Adjacent vertex distinguishing total colorings of 2-degenerate graphs

DOI10.1016/J.DISC.2016.03.019zbMath1339.05141OpenAlexW2405320276MaRDI QIDQ294532

Rui Shi, Rong Luo, Xiaolan Hu, Zheng-Ke Miao

Publication date: 16 June 2016

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

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

zbMATH Keywords

maximum degree2-degenerate graphadjacent vertex distinguishing total coloring

Mathematics Subject Classification ID

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

Related Items (8)

Strict neighbor-distinguishing total index of graphs ⋮ Upper bounds on adjacent vertex distinguishing total chromatic number of graphs ⋮ Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles ⋮ Neighbor product distinguishing total colorings of 2-degenerate graphs ⋮ Neighbor sum distinguishing total colorings of corona of subcubic graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8

Cites Work

• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total coloring of graphs with lower average degree
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Concise proofs for adjacent vertex-distinguishing total colorings
• On the vertex-distinguishing proper edge-colorings of graphs
• Adjacent strong edge coloring of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• A note on the adjacent vertex distinguishing total chromatic number of 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
• Vertex-distinguishing proper edge-colorings

This page was built for publication: Adjacent vertex distinguishing total colorings of 2-degenerate graphs