A min-max theorem for plane bipartite graphs

DOI10.1016/J.DAM.2009.11.004zbMath1225.05197OpenAlexW1978147144MaRDI QIDQ968154

Gary W. Atkinson, Hernán G. Abeledo

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.11.004

zbMATH Keywords

network flowsplane bipartite graphsclar numbercombinatorial dual

Mathematics Subject Classification ID

Applications of graph theory (05C90) Integer programming (90C10) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (7)

Complete forcing numbers of hexagonal systems. II ⋮ Single coronoid systems with an anti-forcing edge ⋮ Complete forcing numbers of complete and almost-complete multipartite graphs ⋮ The complexity of the Clar number problem and an exact algorithm ⋮ Counting clar structures of \((4,6)\)-fullerenes ⋮ Complete forcing numbers of hexagonal systems ⋮ Complete forcing numbers of graphs

Cites Work

• Unimodularity of the Clar number problem
• A min-max result on outerplane bipartite graphs
• A min-max result on catacondensed benzenoid graphs
• Algebraic Characterizations of Unimodular Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A min-max theorem for plane bipartite graphs