Adjacent vertex distinguishing total coloring in split graphs

DOI10.1016/j.disc.2022.113061zbMath1495.05109OpenAlexW4283705368MaRDI QIDQ2166305

B. S. Panda, Shaily Verma, Hung-Lin Fu

Publication date: 24 August 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113061

zbMATH Keywords

split graphsadjacent vertex distinguishing total coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• 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
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
• On the AVDTC of 4-regular graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• 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
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree

This page was built for publication: Adjacent vertex distinguishing total coloring in split graphs