Integer flows

DOI10.1002/jgt.3190070307zbMath0515.05057OpenAlexW4248455257MaRDI QIDQ3661623

Daniel H. Younger

Publication date: 1983

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190070307

zbMATH Keywords

weight functionpolynomial algorithmk-flow5-flow for planar graphs

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Related Items

Superposition and constructions of graphs without nowhere-zero \(k\)-flows, Covering Multigraphs by Simple Circuits, Extensions of flow theorems, A faster test for 4-flow-criticality in snarks, Hypohamiltonian snarks have a 5-flow, 3-Flows and Combs, Unnamed Item, Nowhere-zero 4-flows and cycle double covers, Modulo orientations with bounded independence number, Nowhere-zero 3-flow of graphs with small independence number, Multiple weak 2-linkage and its applications on integer flows of signed graphs, Flow-Critical Graphs, Flows on Signed Graphs without Long Barbells, Integer flows and cycle covers, The flow index and strongly connected orientations, Nowhere-zero 3-flows of highly connected graphs, Graphs with the Circuit Cover Property, Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture, Complementary graphs with flows less than three, Fixed edge-length graph drawing is NP-hard, Polynomials associated with nowhere-zero flows

Cites Work

• A Class Of Abelian Groups