Results 21 to 30 of about 10,073 (269)
A Hybrid Floyd-Warshall and Graph Coloring Algorithm for Finding the Smallest Number of Colors Needed for a Distance Coloring of Graphs [PDF]
Control and Optimization in Applied MathematicsGraph coloring is a crucial area of research in graph theory, with numerous algorithms proposed for various types of graph coloring, particularly graph p-distance coloring.
Hanifa Mosawi +2 more
doaj +1 more source
On coupon colorings of graphs [PDF]
Discrete Applied Mathematics, 2015 Let $G$ be a graph with no isolated vertices. A {\em $k$-coupon coloring} of $G$ is an assignment of colors from $[k] := \{1,2,\dots,k\}$ to the vertices of $G$ such that the neighborhood of every vertex of $G$ contains vertices of all colors from $[k]$.
Bob Chen +3 more
openaire +2 more sources
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source
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
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
Kaleidoscopic colorings of graphs
Discussiones Mathematicae Graph Theory, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chartrand Gary, English Sean, Zhang Ping
openaire +3 more sources
Orthogonal Colorings of Graphs [PDF]
The Electronic Journal of Combinatorics, 1998 An orthogonal coloring of a graph $G$ is a pair $\{c_1,c_2\}$ of proper colorings of $G$, having the property that if two vertices are colored with the same color in $c_1$, then they must have distinct colors in $c_2$. The notion of orthogonal colorings is strongly related to the notion of orthogonal Latin squares. The orthogonal chromatic number of $G$
Yair Caro, Raphael Yuster
openaire +2 more sources
Discrete Applied Mathematics, 1992 For directed graphs \(G=(V_ G,E_ G)\) and \(H=(V_ H,E_ H)\) an \(H\)- coloring of \(G\) is a mapping \(f:V_ G\to V_ H\) such that for all edges \((u,v)\in E_ G\) we have \((f(u),f(v))\in E_ H\). The authors introduce a new technique for proving that the \(H\)-coloring problem is polynomially solvable for some fixed digraphs \(H\).
Gutjahr, W., Welzl, E., Woeginger, G.J.
openaire +2 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