Group chromatic number of Halin graphs
From MaRDI portal
Publication:497348
DOI10.1007/S00373-014-1443-ZzbMATH Open1321.05087OpenAlexW2031135577MaRDI QIDQ497348FDOQ497348
Authors: 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
Recommendations
Cites Work
- Graph theory with applications
- An inequality for the group chromatic number of a graph
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group connectivity of 3-edge-connected chordal graphs
- Group connectivity and group colorings of graphs --- a survey
- Nowhere‐zero 3‐flows in locally connected graphs
- Nowhere-zero 3-flows in triangularly connected graphs
- Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
- The strong chromatic index of Halin graphs
- Group chromatic number of planar graphs of girth at least 4
- Group chromatic number of graphs without \(K_5\)-minors
- List coloring Halin graphs.
- Title not available (Why is that?)
- A note on group colorings
- Two equivalent properties of \(\mathcal Z_3\)-connectivity
- Nowhere‐zero 3‐flows in products of graphs
- Strong edge-coloring for cubic Halin graphs
- On group chromatic number of graphs
- A small non-\(\mathbb Z_4\)-colorable planar graph
Cited In (11)
- On group chromatic number of graphs
- Title not available (Why is that?)
- On the \(A_\alpha\)- spectral radius of Halin graphs
- Extremal Halin graphs with respect to the signless Laplacian spectra
- Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions
- An inequality for the group chromatic number of a graph
- The sharp upper bounds on the \(A_{\alpha}\)-spectral radius of \(C_4\)-free graphs and Halin graphs
- Group chromatic number of planar graphs of girth at least 4
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some further results on the eccentric distance sum
This page was built for publication: Group chromatic number of Halin graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497348)