Group chromatic number of Halin graphs

DOI10.1007/s00373-014-1443-zzbMath1321.05087OpenAlexW2031135577MaRDI QIDQ497348

Xiangwen Li

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1443-z

zbMATH Keywords

group connectivityHalin graphgroup coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (5)

On the \(A_\alpha\)- spectral radius of Halin graphs ⋮ Extremal Halin graphs with respect to the signless Laplacian spectra ⋮ Some further results on the eccentric distance sum ⋮ Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions ⋮ The sharp upper bounds on the \(A_{\alpha}\)-spectral radius of \(C_4\)-free graphs and Halin graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong edge-coloring for cubic Halin graphs
• The strong chromatic index of Halin graphs
• A small non-\(\mathbb Z_4\)-colorable planar graph
• Nowhere-zero 3-flows in triangularly connected graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group chromatic number of graphs without \(K_5\)-minors
• Group connectivity of 3-edge-connected chordal graphs
• Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
• Group connectivity and group colorings of graphs --- a survey
• An inequality for the group chromatic number of a graph
• On group chromatic number of graphs
• Two equivalent properties of \(\mathcal Z_3\)-connectivity
• Nowhere‐zero 3‐flows in locally connected graphs
• Nowhere‐zero 3‐flows in products of graphs
• Group chromatic number of planar graphs of girth at least 4
• A note on group colorings

This page was built for publication: Group chromatic number of Halin graphs