Adjacent vertex distinguishing total colorings of 2-degenerate graphs

DOI10.1016/J.DISC.2016.03.019zbMATH Open1339.05141OpenAlexW2405320276MaRDI QIDQ294532FDOQ294532

Authors: Rui Shi, Xiaolan Hu, Rong Luo, Zhengke 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

Recommendations

• Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• On the adjacent vertex distinguishing total chromatic number of outer plane graph.

zbMATH Keywords

maximum degree2-degenerate graphadjacent vertex distinguishing total coloring

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
• Title not available (Why is that?)
• List total arboricity of 2-degenerate graphs
• Strict neighbor-distinguishing total index of graphs
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
• Adjacent vertex distinguishing total coloring of graphs with lower average degree
• Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
• Neighbor sum distinguishing total colorings of corona of subcubic graphs
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
• Neighbor product distinguishing total colorings of 2-degenerate graphs
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• Neighbor product distinguishing total coloring of planar graphs without 5-cycles
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven

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

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