The circular flow number of a 6-edge connected graph is less than four

DOI10.1007/s004930200025zbMath1006.05049OpenAlexW2094094736MaRDI QIDQ1857409

Anna Galluccio, Luis A. Goddyn

Publication date: 18 February 2003

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930200025

zbMATH Keywords

circular flow number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Packing spanning trees in highly essentially connected graphs ⋮ Flows and parity subgraphs of graphs with large odd-edge-connectivity ⋮ Nearly nowhere-zero \(r\)-flow graphs ⋮ Circular flow on signed graphs ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations

This page was built for publication: The circular flow number of a 6-edge connected graph is less than four