Flow extensions and group connectivity with applications

DOI10.1016/j.ejc.2020.103164zbMath1447.05095arXiv2005.00297OpenAlexW3032608824MaRDI QIDQ2198992

Jiaao Li

Publication date: 15 September 2020

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

Full work available at URL: https://arxiv.org/abs/2005.00297

zbMATH Keywords

circular flownowhere-zero flowsnowhere-zero 3-flow

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Three-edge-colouring doublecross cubic graphs
• Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs
• The weak 3-flow conjecture and the weak circular flow conjecture
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Every planar graph is 5-choosable
• Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
• A short list color proof of Grötzsch's theorem
• An equivalent version of the 3-flow conjecture
• 3-list-coloring planar graphs of girth 5
• A Reduction Method for Edge-Connectivity in Graphs
• Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees
• Group chromatic number of planar graphs of girth at least 4
• On the algebraic theory of graph colorings
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Flow extensions and group connectivity with applications