On the AVDTC of 4-regular graphs

DOI10.1016/J.DISC.2014.03.019zbMATH Open1295.05109OpenAlexW2028137198MaRDI QIDQ2017055FDOQ2017055

Authors: Yanyan Li 

Publication date: 25 June 2014

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

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

Recommendations

• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• scientific article; zbMATH DE number 21752
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• Adjacent vertex distinguishing total colorings of graphs with four distinguishing constraints.
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9

zbMATH Keywords

4-regular graphadjacent-vertex-distinguishing total coloringAVDTC

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• On adjacent-vertex-distinguishing total coloring of graphs
• Graph theory with applications
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• A solution to a colouring problem of P. Erdős
• Title not available (Why is that?)

Cited In (15)

• Title not available (Why is that?)
• Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
• On the AVDTC of Sierpiński-type graphs
• Adjacent vertex distinguishing total coloring in split graphs
• General vertex-distinguishing total coloring of graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• Strict neighbor-distinguishing total index of graphs
• On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs
• On the total and AVD-total coloring of graphs
• Inclusion total chromatic number
• Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)

This page was built for publication: On the AVDTC of 4-regular graphs

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