Upper bounds on vertex distinguishing chromatic indices of some Halin graphs

DOI10.1007/s11766-012-3009-2zbMath1289.05186OpenAlexW2069770878MaRDI QIDQ377916

Junqiao Zhu, Yuehua Bu

Publication date: 19 November 2013

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-012-3009-2

zbMATH Keywords

upper boundplanar graphHalin graphvertex-distinguishing edge coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
• AVDTC numbers of generalized Halin graphs with maximum degree at least 6
• On the vertex-distinguishing proper edge-colorings of graphs
• On the complete chromatic number of Halin graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• Vertex-distinguishing proper edge-colorings
• Vertex-distinguishing edge colorings of graphs
• A note on the vertex-distinguishing proper coloring of graphs with large minimum degree

This page was built for publication: Upper bounds on vertex distinguishing chromatic indices of some Halin graphs