Results 21 to 30 of about 1,402,601 (292)
A note on Goldberg's conjecture on total chromatic numbers [PDF]
Journal of Graph Theory, 2021 AbstractLet be a multigraph with maximum degree , chromatic index , and total chromatic number . The total coloring conjecture proposed by Behzad and Vizing, independently, states that for a multigraph , where is the multiplicity of . Moreover, Goldberg conjectured that if and noticed the conjecture holds when is an edge‐chromatic critical graph.
Yan Cao 0001 +2 more
openaire +3 more sources
TOTAL CHROMATIC NUMBER OF FUZZY BISTAR GRAPH & FUZZY HELM GRAPH
INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH, 2022 Fuzzy total chromatic number is the least value of k such that k-fuzzy total coloring exist. In this paper, we discussed the concept of total coloring of graphs to Fuzzy bistar graph and Fuzzy helm graph.
A. Deebamonica, A. Marydayana
semanticscholar +1 more source
Total dominator total chromatic numbers of cycles and paths
RAIRO - Operations Research, 2023 The total dominator total coloring of a graph is a total coloring of the graph such that each object (vertex or edge) of the graph is adjacent or incident to every object of some color class. The minimum number of the color classes of a total dominator total coloring of a graph is called the total dominator total chromatic number of the graph. In (A.P.
Adel P. Kazemi, Farshad Kazemnejad
openaire +2 more sources
Equitable Total Coloring of Corona of Cubic Graphs
Discussiones Mathematicae Graph Theory, 2021 The minimum number of total independent partition sets of V ∪ E of a graph G = (V, E) is called the total chromatic number of G, denoted by X′(G). If the di erence between cardinalities of any two total independent sets is at most one, then the minimum ...
Furmańczyk Hanna, Zuazua Rita
doaj +1 more source
Total Global Dominator Coloring of Trees and Unicyclic Graphs
مجلة بغداد للعلوم, 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 +1 more source
On Adjacent Vertex-distinguishing Equitable-total Chromatic Number of Pm ∨ Fm
, 2021 Suppose the simple graph G(V, E) is at least 2nd-order connected. We study the adjacent vertex-distinguishing equitable-total coloring of the join graph Pm ∨ Fm which belongs to the graph G(V, E). By constructing the total coloring of Pm ∨ Fm , we obtain
Jishun Wang +3 more
semanticscholar +1 more source
A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs [PDF]
The Art of Discrete and Applied MathematicsA proper total colouring of a graph $G$ is called harmonious if it has the further property that when replacing each unordered pair of incident vertices and edges with their colours, then no pair of colours appears twice.
M. Abreu +6 more
semanticscholar +1 more source
Frontiers in Materials, 2022 Chromatic aberration is one of the quality defects in the appearance of fair-faced concrete (FFC). The mainly surface chromatic aberration identification (CAI) method being applied is manual observation, which is subjective and time-consuming.
Gang Yao +7 more
doaj +1 more source
Total Colouring of New Classes of Subcubic graphs
Theory and Applications of Graphs, 2022 The total chromatic number of a graph $G$, denoted $\chi^{\prime\prime}(G)$, is the least number of colours needed to colour the vertices and the edges of $G$ such that no incident or adjacent elements (vertices or edges) receive the same colour.
Sethuraman G, Velankanni Anthonymuthu
doaj +1 more source
Complete characterization of graphs with local total antimagic chromatic number 3 [PDF]
Opuscula MathematicaA total labeling of a graph \(G = (V, E)\) is said to be local total antimagic if it is a bijection \(f: V\cup E \to\{1,\ldots,|V|+|E|\}\) such that adjacent vertices, adjacent edges, and pairs of an incident vertex and edge have distinct induced weights
Gee-Choon Lau
doaj +1 more source