AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)

DOI10.1016/j.dam.2016.09.041zbMath1358.05111OpenAlexW2539041821MaRDI QIDQ516897

C. N. Campos, Atílio G. Luiz, Célia Picinin de Mello

Publication date: 15 March 2017

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

Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.041

zbMATH Keywords

total colouringsnarksadjacent-vertex-distinguishing colouringgraphs without adjacent vertices of maximum degree

Mathematics Subject Classification ID

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

Related Items (3)

Adjacent vertex distinguishing total coloring in split graphs ⋮ A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) ⋮ Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve

Cites Work

• Unnamed Item
• AVDTC numbers of generalized Halin graphs with maximum degree at least 6
• 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
• Construction of class two graphs with maximum vertex degree three
• Total colourings of graphs
• Snarks without small cycles
• On the AVDTC of 4-regular graphs
• Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
• AVD-total-colouring of complete equipartite 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
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable

This page was built for publication: AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)