Adjacent vertex distinguishing total coloring of graphs with lower average degree

DOI10.11650/TWJM/1500404991zbMATH Open1168.05023OpenAlexW1545218634MaRDI QIDQ947049FDOQ947049

Authors: Weifan Wang, Yiqiao Wang 

Publication date: 29 September 2008

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500404991

Recommendations

• Adjacent vertex distinguishing total colorings of graphs with smaller degrees
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent vertex distinguishing total coloring of a class of graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Vertex-edge adjacent vertex-distinguishing total colorings of some graphs
• Adjacent vertex-distinguishing edge coloring of graphs
• Adjacent vertex distinguishing total coloring on the middle graphs
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• Adjacent vertex-distinguishing total colorings of graphs with constraint conditions
• A note on adjacent vertex distinguishing colorings of graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (15)

• Title not available (Why is that?)
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• Adjacent vertex distinguishing total colorings of graphs with smaller degrees
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
• The algorithm for adjacent vertex distinguishing proper edge coloring of graphs
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
• Neighbor sum distinguishing total colorings of corona of subcubic graphs
• The adjacent vertex distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree
• Distant set distinguishing total colourings of graphs

This page was built for publication: Adjacent vertex distinguishing total coloring of graphs with lower average degree

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