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

DOI10.1016/J.DAM.2016.09.041MaRDI QIDQ516897zbMATH OpenOpenAlexFDO

Authors Atílio G. Luiz, C. N. Campos, Célia P. 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) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)

Recommendations

• AVD-total-colouring of complete equipartite graphs
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• scientific article; zbMATH DE number 6423760
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9

Cites work

• AVD-total-colouring of complete equipartite graphs
• AVDTC numbers of generalized Halin graphs with maximum degree at least 6
• Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
• Adjacent-vertex-distinguishing total coloring of indifference graphs
• Concise proofs for adjacent vertex-distinguishing total colorings
• Construction of class two graphs with maximum vertex degree three
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• On adjacent-vertex-distinguishing total coloring of graphs
• On the AVDTC of 4-regular graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• Snarks without small cycles
• The adjacent vertex distinguishing total coloring of planar graphs
• Total colourings of graphs

Cited in

(9)

• AVDTC numbers of generalized Halin graphs with maximum degree at least 6
• Adjacent vertex distinguishing total coloring in split graphs
• On the AVDTC of Sierpiński-type graphs
• A note on decycling number, vertex partition and AVD-total coloring in graphs
• AVD-total-colouring of complete equipartite graphs
• scientific article; zbMATH DE number 6423760 (Why is no real title available?)
• Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
• On generalisations of the AVD conjecture to digraphs
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with = 13

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516897)