Adjacent vertex distinguishing total coloring of graphs with lower average degree

DOI10.11650/twjm/1500404991zbMath1168.05023OpenAlexW1545218634MaRDI QIDQ947049

Yi Qiao Wang, Wei Fan 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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

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

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