On the total and AVD-total coloring of graphs

DOI10.1016/j.akcej.2019.10.004OpenAlexW3047680049MaRDI QIDQ4956171

Yash Keerti, Shaily Verma, B. S. Panda

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2019.10.004

zbMATH Keywords

chain graphstotal coloringtotal coloring conjectureAVD-total coloringcentral graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Total colorings-a survey ⋮ Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Total-chromatic number and chromatic index of dually chordal graphs
• Total chromatic number of unichord-free graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
• Concise proofs for adjacent vertex-distinguishing total colorings
• The total chromatic number of nearly complete bipartite graphs
• Total colouring regular bipartite graphs is NP-hard
• On the AVDTC of 4-regular graphs
• The adjacent vertex distinguishing total coloring of planar graphs
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On adjacent-vertex-distinguishing total coloring of graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Edge and total coloring of interval graphs

This page was built for publication: On the total and AVD-total coloring of graphs