Results 41 to 50 of about 82,445 (208)
AN INCLUSIVE LOCAL IRREGULARITY VERTEX COLORING OF BOOK GRAPH FAMILY
Barekeng, 2023 Let is a simple and connected graph with as vertex set and as edge set. Vertex labeling on inclusive local irregularity vertex coloring is defined by mapping and the function of the inclusive local irregularity vertex coloring is with .
Robiatul Adawiyah +2 more
doaj +1 more source
Acyclic edge-coloring using entropy compression [PDF]
, 2013 An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta has an acyclic edge-coloring with at most 4 Delta - 4 colors, improving the ...
Aline Parreau +14 more
core +3 more sources
Discrete Mathematics & Theoretical Computer ScienceWe introduce coloring groups, which are permutation groups obtained from a proper edge coloring of a graph. These groups generalize the generalized toggle groups of Striker (which themselves generalize the toggle groups introduced by Cameron and Fon-der ...
Ben Adenbaum, Alexander Wilson
doaj +1 more source
Graphs with coloring redundant edges
Electronic Journal of Graph Theory and Applications, 2016 A graph edge is $d$-coloring redundant if the removal of the edge doesnot change the set of $d$-colorings of the graph. Graphs that are toosparse or too dense do not have coloring redundant edges.
Bart Demoen, Phuong-Lan Nguyen
doaj +1 more source
On hamiltonian colorings of graphs
Discrete Mathematics, 2005 The authors give a lower bound for the circumference of a graph in terms of the number of vertices that receive colors between two specified colors in a Hamiltonian coloring of the graph. As a consequence, if there exists a Hamiltonian coloring of a connected graph \(G\) of order \(n\) such that at least \((n+2)/2\) vertices of \(G\) are colored with ...
Ping Zhang +2 more
openaire +3 more sources
On the total and AVD-total coloring of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A total coloring of a graph G is an assignment of colors to the vertices and the edges such that (i) no two adjacent vertices receive same color, (ii) no two adjacent edges receive same color, and (iii) if an edge e is incident on a vertex v, then v and ...
B. S. Panda, Shaily Verma, Yash Keerti
doaj +1 more source
Normal 6-edge-colorings of some bridgeless cubic graphs
, 2019 In an edge-coloring of a cubic graph, an edge is poor or rich, if the set of colors assigned to the edge and the four edges adjacent it, has exactly five or exactly three distinct colors, respectively.
Mazzuoccolo, Giuseppe, Mkrtchyan, Vahan
core +1 more source
Discrete Mathematics, 1992 Given a finite set \(T\) of natural numbers containing 0, a \(T\)-coloring of a simple graph \(G=(V(G),E(G))\) is a function \(f\) from the vertex set \(V(G)\) to natural numbers such that \(| f(u)-f(v)|\notin T\) whenever \(\{u,v\}\in E(G)\). The span of a \(T\)-coloring is defined to be the difference between the largest and smallest color used. The \
openaire +2 more sources
The distance coloring of graphs [PDF]
Acta Mathematica Sinica, English Series, 2014 Let $G$ be a connected graph with maximum degree $ \ge 3$. We investigate the upper bound for the chromatic number $ _ (G)$ of the power graph $G^ $. It was proved that $ _ (G) \le \frac{( -1)^ -1}{ -2}+1=:M+1$ with equality if and only $G$ is a Moore graph.
Lian Ying Miao, Yi-Zheng Fan
openaire +3 more sources
AKCE International Journal of Graphs and Combinatorics, 2023 We introduce a concept in graph coloring motivated by the popular Sudoku puzzle. Let [Formula: see text] be a graph of order n with chromatic number [Formula: see text] and let [Formula: see text] Let [Formula: see text] be a k-coloring of the induced ...
J. Maria Jeyaseeli +3 more
doaj +1 more source