Results 71 to 80 of about 82,445 (208)
Pseudo-scheduling: A New Approach to the Broadcast Scheduling Problem
, 2012 The broadcast scheduling problem asks how a multihop network of broadcast transceivers operating on a shared medium may share the medium in such a way that communication over the entire network is possible.
DiPippo, Lisa C., Joseph, Shaun N.
core +1 more source
On Twin Edge Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2014 A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring.
Andrews Eric +4 more
doaj +1 more source
On List Equitable Total Colorings of the Generalized Theta Graph
Discussiones Mathematicae Graph Theory, 2021 In 2003, Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A k-assignment, L, for a graph G assigns a list, L(v), of k available colors to each v ∈ V (G), and an equitable L-coloring of G is a ...
Mudrock Jeffrey A. +2 more
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1973 AbstractIn this paper, the notion of relative chromatic number χ(G, H) for a pair of graphs G, H, with H a full subgraph of G, is formulated; namely, χ(G, H) is the minimum number of new colors needed to extend any coloring of H to a coloring of G. It is shown that the four color conjecture (4CC) is equivalent to the conjecture (R4CC) that χ(G, H) ≤ 4 ...
openaire +3 more sources
Discussiones Mathematicae Graph Theory, 2023 DP-coloring is generalized via relaxed coloring and variable degeneracy in [P. Sittitrai and K. Nakprasit, Su cient conditions on planar graphs to have a relaxed DP-3-coloring, Graphs Combin. 35 (2019) 837–845], [K.M. Nakprasit and K.
Sribunhung Sarawute +3 more
doaj +1 more source
The identification numbers of lollipop graphs
AIMS MathematicsA nontrivial connected graph $ G $ with diameter $ d $ can be assigned a red-white coloring, where the vertices of $ G $ are colored either red or white, with the stipulation that at least one vertex must be red. Associated with each vertex $ v $ of $ G $
Gaixiang Cai, Fengru Xiao, Guidong Yu
doaj +1 more source
Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Keluarga Graf Unicyclic
Contemporary Mathematics and Applications (ConMathA), 2022 The graph in this paper is a simple and connected graph with V(G) is vertex set and E(G) is edge set. An inklusif local irregularity vertex coloring is defined should be maping l:V(G) í {1,2,..., k} as vertex labeling and wi : V(G) í N is function of ...
Arika Indah Kristiana +2 more
doaj +1 more source
Coloring graphs with crossings
Discrete Mathematics, 2009 We generalize the Five Color Theorem by showing that it extends to graphs with two crossings. Furthermore, we show that if a graph has three crossings, but does not contain K_6 as a subgraph, then it is also 5-colorable. We also consider the question of whether the result can be extended to graphs with more crossings.
Bogdan Oporowski, David Zhao
openaire +3 more sources
Graph Coloring Algorithm Based on Minimal Cost Graph Neural Network
IEEE AccessThe graph coloring problem functions as a fundamental and pivotal combinatorial optimization task and has played an essential role in various domains such as wireless spectrum management, register planning, and event scheduling.
Ming Gao, Jing Hu
doaj +1 more source
MATHEMATICA APPLICATION FOR GRAPH COLORING AT THE INTERSECTION OF JALAN PANGERAN ANTASARI JAKARTA
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2017 This research examines about graph coloring using Welch-Powell algorithm. This research begins by trying to understand about graph coloring and its algorithm. The case study was conducted at the intersection of Pangeran Antasari Street.
Suwarno Suwarno
doaj +1 more source