Group chromatic number of planar graphs of girth at least 4
From MaRDI portal
Publication:5471059
DOI10.1002/jgt.20147zbMath1088.05032OpenAlexW4250153949MaRDI QIDQ5471059
Publication date: 6 June 2006
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20147
Related Items (10)
Disproof of the group coloring version of the Hadwiger conjecture ⋮ Group connectivity of bridged graphs ⋮ Strong 3‐Flow Conjecture for projective planar graphs ⋮ Flow extensions and group connectivity with applications ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ Homomorphisms to small negative even cycles ⋮ A note on group choosability of graphs with girth at least 4 ⋮ Group chromatic number of Halin graphs ⋮ On mod \((2p+1)\)-orientations of graphs ⋮ The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
Cites Work
This page was built for publication: Group chromatic number of planar graphs of girth at least 4