Integer flows

DOI10.1002/JGT.3190070307zbMATH Open0515.05057OpenAlexW4248455257MaRDI QIDQ3661623FDOQ3661623

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)

Cites Work

• A Class Of Abelian Groups

Cited In (22)

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

This page was built for publication: Integer flows

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