Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs

DOI10.4310/JOC.2016.V7.N2.A1MaRDI QIDQ286749zbMATH OpenOpenAlexWikidataFDO

Authors Carsten Thomassen, Daniel H. Younger, R. B. Richter

Publication date 25 May 2016

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/joc.2016.v7.n2.a1

zbMATH Keywords

\(\Gamma\) colourable graph

Mathematics Subject Classification ID

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

Recommendations

• Group chromatic number of planar graphs of girth at least 4
• Group connectivity and group colorings of graphs --- a survey
• Flow extensions and group connectivity with applications
• On group choosability of graphs. II
• scientific article; zbMATH DE number 6391575

Cited in

(7)

• The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
• Flow extensions and group connectivity with applications
• Group connectivity and group coloring: small groups versus large groups
• Strong 3‐Flow Conjecture for projective planar graphs
• On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs
• Homomorphisms to small negative even cycles
• Every signed planar graph of girth 5 has circular chromatic number strictly less than 4

This page was built for publication: Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs

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