Integer flows

DOI10.1002/JGT.3190070307MaRDI QIDQ3661623zbMATHOpenAlexFDO

Authors 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)

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