Sparsity of 3-flow-critical graphs

DOI10.1016/J.EJC.2025.104174MaRDI QIDQ6957480zbMATH OpenFDO

Authors Zdeněk Dvořák, Serguei Norine

Publication date 16 July 2025

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

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104174

zbMATH Keywords

4-critical planar graphsGrünbaum's problem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Flows in graphs (05C21) Connectivity (05C40)

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• An equivalent version of the 3-flow conjecture
• Constructing a Family of 4‐Critical Planar Graphs with High Edge Density
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3269727 (Why is no real title available?)
• scientific article; zbMATH DE number 3361909 (Why is no real title available?)
• scientific article; zbMATH DE number 3195967 (Why is no real title available?)
• Note to a problem of T. Gallai and G. A. Dirac
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Nowhere-zero 6-flows
• On 3-flow-critical graphs
• On 4-critical planar graphs with high edge density
• Ore's conjecture on color-critical graphs is almost true
• Subgraphs of colour-critical graphs
• The edge-density of 4-critical planar graphs

This page was built for publication: Sparsity of 3-flow-critical graphs

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