2-distance vertex-distinguishing total coloring of graphs

DOI10.1142/S1793830918500180zbMath1383.05101OpenAlexW2782887305MaRDI QIDQ4634521

Yafang Hu, Wei Fan Wang

Publication date: 10 April 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830918500180

zbMATH Keywords

Cartesian productsunicycle graph\(2\)-distance vertex-distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On \(d_2\)-coloring of certain families of graphs

Cites Work

• Unnamed Item
• A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
• The adjacent vertex distinguishing total chromatic number
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• A bound on the total chromatic number
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On adjacent-vertex-distinguishing total coloring of graphs

This page was built for publication: 2-distance vertex-distinguishing total coloring of graphs