A note on group choosability of graphs with girth at least 4

DOI10.1007/S00373-010-0971-4zbMath1234.05100OpenAlexW2084440580MaRDI QIDQ659688

Gholam Reza Omidi

Publication date: 24 January 2012

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0971-4

zbMATH Keywords

chromatic numbergirthgroup choice numbergroup choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (5)

Edge-group choosability of outerplanar and near-outerplanar graphs ⋮ Group edge choosability of planar graphs without adjacent short cycles ⋮ A note on edge-group choosability of planar graphs without 5-cycles ⋮ On chromatic numbers of two extensions of planar graphs ⋮ On group choosability of graphs. II

Cites Work

• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group chromatic number of graphs without \(K_5\)-minors
• 3-list-coloring planar graphs of girth 5
• On group choosability of graphs. II
• On group chromatic number of graphs
• Über einen Satz von K.Wagner zum Vierfarbenproblem
• Group chromatic number of planar graphs of girth at least 4

This page was built for publication: A note on group choosability of graphs with girth at least 4