Vertex distinguishing equitable total chromatic number of join graphs

DOI10.1007/s10255-007-0383-2zbMath1130.05027OpenAlexW2014875745MaRDI QIDQ2468789

Lihong Yan, Zhong Fu Zhang, Zhi-wen Wang

Publication date: 25 January 2008

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-007-0383-2

zbMATH Keywords

cyclepathjoin graphvertex distinguishing equitable total chromatic number

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On the adjacent vertex-distinguishing equitable edge coloring of graphs ⋮ Total colorings-a survey ⋮ Strong labelings of linear forests

Cites Work

• On the vertex-distinguishing proper edge-colorings of graphs
• Vertex-distinguishing proper edge-colorings
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex distinguishing equitable total chromatic number of join graphs