Results 11 to 20 of about 44,462 (291)
Total Coloring of Dumbbell Maximal Planar Graphs [PDF]
Mathematics, 2022 The Total Coloring Conjecture (TCC) states that every simple graph G is totally (Δ+2)-colorable, where Δ denotes the maximum degree of G. In this paper, we prove that TCC holds for dumbbell maximal planar graphs.
Yangyang Zhou +3 more
doaj +2 more sources
Total Global Dominator Coloring of Trees and Unicyclic Graphs [PDF]
مجلة بغداد للعلوم, 2023 A total global dominator coloring of a graph is a proper vertex coloring of with respect to which every vertex in dominates a color class, not containing and does not dominate another color class.
Chithra K. P., Joseph Mayamma
doaj +3 more sources
A decomposition for total‐coloring partial‐grids and list‐total‐coloring outerplanar graphs [PDF]
Networks, 2011 AbstractThe total chromatic number χT(G) is the least number of colors sufficient to color the elements (vertices and edges) of a graph G in such a way that no incident or adjacent elements receive the same color. In the present work, we obtain two results on total‐coloring. First, we extend the set of partial‐grids classified with respect to the total‐
Raphael C. S. Machado +1 more
core +5 more sources
Total Coloring Conjecture for Certain Classes of Graphs [PDF]
Algorithms, 2018 A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no two adjacent or incident elements receive the same color.
R. Vignesh, J. Geetha, K. Somasundaram
doaj +2 more sources
Zig-zag facial total-coloring of plane graphs [PDF]
Opuscula Mathematica, 2018 In this paper we introduce the concept of zig-zag facial total-coloring of plane graphs. We obtain lower and upper bounds for the minimum number of colors which is necessary for such a coloring.
Július Czap +2 more
doaj +3 more sources
AKCE International Journal of Graphs and Combinatorics, 2023 The smallest integer k needed for the assignment of k colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph.
Jayabalan Geetha +2 more
doaj +3 more sources
Generalized Fractional Total Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2015 Let P and Q be additive and hereditary graph properties and let r, s be integers such that r ≥ s. Then an r/s -fractional (P,Q)-total coloring of a finite graph G = (V,E) is a mapping f, which assigns an s-element subset of the set {1, 2, . . .
Karafová Gabriela, Soták Roman
doaj +3 more sources
2-Quasitotal Fuzzy Graphs and Their Total Coloring [PDF]
Advances in Fuzzy Systems, 2020 Coloring of fuzzy graphs has many real-life applications in combinatorial optimization problems like traffic light system, exam scheduling, and register allocation. The coloring of total fuzzy graphs and its applications are well studied. This manuscript
V. N. Srinivasa Rao Repalle +1 more
doaj +2 more sources
Equitable total coloring of Cm□Cn [PDF]
Discrete Applied Mathematics, 2009 AbstractThe equitable total chromatic number of a graph G is the smallest integer k for which G has a k-total coloring such that the number of vertices and edges colored with each color differs by at most one. In this paper, we show that the Cartesian product graphs of Cm and Cn have equitable total 5-coloring for all m≥3 and n≥3.
Chunling Tong +3 more
openaire +2 more sources
Oriented total-coloring of oriented graphs [PDF]
Discrete MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bensmail, Julien +6 more
openaire +3 more sources