scientific article; zbMATH DE number 863473

zbMath0845.05035MaRDI QIDQ4871752

P. D. Seymour

Publication date: 20 August 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

integer flow

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (25)

Neighbour-distinguishing labellings of families of graphs ⋮ Hypohamiltonian snarks have a 5-flow ⋮ Eulerian colorings and the bipartizing matchings conjecture of Fleischner ⋮ The number of nowhere-zero flows on graphs and signed graphs ⋮ Flows, view obstructions, and the lonely runner ⋮ Flow-Critical Graphs ⋮ Nowhere–zero bases for the nullspace of the incidence matrices of graphs ⋮ Flow-continuous mappings -- the influence of the group ⋮ Antisymmetric flows and edge-connectivity ⋮ Zero-sum flows of the linear lattice. ⋮ All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Parity subgraphs with few common edges and nowhere-zero 5-flow ⋮ Intersecting 1-factors and nowhere-zero 5-flows ⋮ Rigidity and the lower bound theorem for doubly Cohen-Macaulay complexes ⋮ Nowhere-zero flow polynomials ⋮ Binomial inequalities for chromatic, flow, and tension polynomials ⋮ The algebra of flows in graphs ⋮ On the strong circular 5‐flow conjecture ⋮ Flows, flow-pair covers and cycle double covers ⋮ Antisymmetric flows and strong colourings of oriented graphs ⋮ Circuit Double Covers of Graphs ⋮ Nowhere-zero flows in random graphs ⋮ An equivalent version of the 3-flow conjecture ⋮ Polynomials associated with nowhere-zero flows

This page was built for publication: