AVDTC numbers of generalized Halin graphs with maximum degree at least 6

DOI10.1007/s10255-005-5222-8zbMath1147.05027OpenAlexW2025481977MaRDI QIDQ925977

Zhong Fu Zhang, Xiang'en Chen

Publication date: 26 May 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-005-5222-8

zbMATH Keywords

graphtotal coloringadjacent-vertex-distinguishing total chromatic numberadjacent-vertex-distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Upper bounds on vertex distinguishing chromatic indices of some Halin graphs ⋮ AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) ⋮ Equitable total coloring of \(F_n \vee W_n\) ⋮ General vertex-distinguishing total coloring of graphs ⋮ AVD-total-colouring of complete equipartite graphs

Cites Work

• On the vertex-distinguishing proper edge-colorings of graphs
• On the complete chromatic number of Halin graphs
• Adjacent strong edge coloring of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• On adjacent-vertex-distinguishing total coloring of graphs
• Vertex-distinguishing proper edge-colorings
• Vertex-distinguishing edge colorings of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: AVDTC numbers of generalized Halin graphs with maximum degree at least 6