On group choosability of graphs. II
From MaRDI portal
Publication:2014707
DOI10.1007/s00373-013-1297-9zbMath1294.05059OpenAlexW2009663416MaRDI QIDQ2014707
Publication date: 16 June 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1297-9
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items
Graph polynomials and group coloring of graphs ⋮ Edge-group choosability of outerplanar and near-outerplanar graphs ⋮ Group edge choosability of planar graphs without adjacent short cycles ⋮ A note on group choosability of graphs with girth at least 4 ⋮ On chromatic numbers of two extensions of planar graphs ⋮ Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on group choosability of graphs with girth at least 4
- A relaxed Hadwiger's conjecture for list colorings
- Another proof of the 5-choosability of \(K_5\)-minor-free graphs
- List-coloring graphs without \(K_{4,k}\)-minors
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Every planar graph is 5-choosable
- Group chromatic number of graphs without \(K_5\)-minors
- A short list color proof of Grötzsch's theorem
- Choosability of \(K_5\)-minor-free graphs
- 3-list-coloring planar graphs of girth 5
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
- On group chromatic number of graphs
- Graphs with forbidden subgraphs
- Defective choosability of graphs with no edge-plus-independent-set minor
- Mathematical Foundations of Computer Science 2004
- A note on group colorings
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- A note on primitive skew curves
This page was built for publication: On group choosability of graphs. II
