Circular Flows in Planar Graphs

DOI10.1137/19M1242513zbMath1433.05137arXiv1812.09833OpenAlexW3008794855MaRDI QIDQ5216780

Daniel W. Cranston, Jiaao Li

Publication date: 20 February 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

circular flowmodulo orientationcircular coloringstrongly \({\mathbb Z}_5\) connectedstrongly \({\mathbb Z}_7\) connected

Mathematics Subject Classification ID

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

Related Items (5)

On the density of \(C_7\)-critical graphs ⋮ Circular coloring and fractional coloring in planar graphs ⋮ Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem ⋮ Fractional coloring planar graphs under Steinberg-type conditions ⋮ Homomorphisms to small negative even cycles

Cites Work

• Unnamed Item
• On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs
• The weak 3-flow conjecture and the weak circular flow conjecture
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Antisymmetric flows and strong colourings of oriented graphs
• On the maximum average degree and the oriented chromatic number of a graph
• Colorings and girth of oriented planar graphs
• Homomorphisms from sparse graphs with large girth.
• Density of 5/2-critical graphs
• Counterexamples to Jaeger's circular flow conjecture
• On the density of \(C_7\)-critical graphs
• Circular \((5,2)\)-coloring of sparse graphs
• Oriented 5-coloring of sparse plane graphs
• Circular flows of nearly Eulerian graphs and vertex-splitting
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions
• On (k,d)-colorings and fractional nowhere-zero flows
• Additive Bases and Flows in Graphs
• Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees

This page was built for publication: Circular Flows in Planar Graphs