Upper bounds on vertex distinguishing chromatic indices of some Halin graphs

DOI10.1007/S11766-012-3009-2zbMATH Open1289.05186OpenAlexW2069770878MaRDI QIDQ377916FDOQ377916

Authors: 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

Recommendations

• Upper bounds for the strong chromatic index of Halin graphs
• An upper bound on the vertex-distinguishing IE-total chromatic number of graphs
• An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
• The chromatic distinguishing index of certain graphs
• A bound of the vertex-distinguishing total chromatic number of graphs
• One upper bound on the \(D(2)\)-vertex-distinguishing chromatic numbers of graphs
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
• The strong chromatic index of Halin graphs
• scientific article; zbMATH DE number 5127200

zbMATH Keywords

planar graphupper boundHalin 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

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

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the inclusion chromatic index of a Halin graph
• Vertex-distinguishing proper edge colourings of some regular graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q377916)