On group choosability of graphs. II

DOI10.1007/S00373-013-1297-9zbMATH Open1294.05059OpenAlexW2009663416MaRDI QIDQ2014707FDOQ2014707

Authors Yanyan Li

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

zbMATH Keywords

list coloringcoloringsgroup connectivitygroup coloringsgroup choice numbergroup list colorings

Mathematics Subject Classification ID

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

Recommendations

• On group choosability of graphs. I.
• A note on group choosability of graphs with girth at least 4
• Edge-group choosability of outerplanar and near-outerplanar graphs
• A note on edge-group choosability of planar graphs without 5-cycles
• A note on group colorings

Cites work

• scientific article; zbMATH DE number 4134069 (Why is no real title available?)
• scientific article; zbMATH DE number 890665 (Why is no real title available?)
• scientific article; zbMATH DE number 3102312 (Why is no real title available?)
• 3-list-coloring planar graphs of girth 5
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• A note on group choosability of graphs with girth at least 4
• A note on group colorings
• A note on primitive skew curves
• A relaxed Hadwiger's conjecture for list colorings
• A short list color proof of Grötzsch's theorem
• Another proof of the 5-choosability of \(K_5\)-minor-free graphs
• Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
• Choosability of \(K_5\)-minor-free graphs
• Defective choosability of graphs with no edge-plus-independent-set minor
• Every planar graph is 5-choosable
• Graph theory
• Graphs with forbidden subgraphs
• Group chromatic number of graphs without \(K_5\)-minors
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• List colourings of graphs
• List-coloring graphs without \(K_{4,k}\)-minors
• Mathematical Foundations of Computer Science 2004
• On group choosability of graphs. I.
• On group chromatic number of graphs

Cited in

(13)

• Group chromatic number of graphs without \(K_5\)-minors
• Graph polynomials and group coloring of graphs
• On chromatic numbers of two extensions of planar graphs
• A note on group colorings
• Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs
• Mathematical Foundations of Computer Science 2004
• Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions
• Edge-group choosability of outerplanar and near-outerplanar graphs
• On group choosability of total graphs
• Group activity selection on graphs: parameterized analysis
• A note on group choosability of graphs with girth at least 4
• Group edge choosability of planar graphs without adjacent short cycles
• On group choosability of graphs. I.

This page was built for publication: On group choosability of graphs. II

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