A min-max theorem for plane bipartite graphs
DOI10.1016/J.DAM.2009.11.004zbMATH Open1225.05197OpenAlexW1978147144MaRDI QIDQ968154FDOQ968154
Authors: 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
Recommendations
- A min-max result on outerplane bipartite graphs
- On a min--max theorem on bipartite graphs
- Upper bounds on minimum balanced bipartitions of plane graphs
- scientific article; zbMATH DE number 3258070
- Approximate min-max relations on plane graphs
- A min-max property of chordal bipartite graphs with applications
- On an extremal problem in the class of bipartite 1-planar graphs
- The degree/diameter problem in maximal planar bipartite graphs
- The degree/diameter problem in maximal planar bipartite graphs
- scientific article; zbMATH DE number 952954
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unimodularity of the Clar number problem
- Title not available (Why is that?)
- A min-max result on outerplane bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic Characterizations of Unimodular Matrices
- Title not available (Why is that?)
- A min-max result on catacondensed benzenoid graphs
Cited In (14)
- A network flow approach to a common generalization of Clar and Fries numbers
- Unimodularity of the Clar number problem
- Title not available (Why is that?)
- A min-max result on outerplane bipartite graphs
- Complete forcing numbers of complete and almost-complete multipartite graphs
- Minimum balanced bipartitions of planar triangulations
- Complete forcing numbers of \((4, 6)\)-fullerenes
- A min-max property of chordal bipartite graphs with applications
- Complete forcing numbers of graphs
- Complete forcing numbers of hexagonal systems
- Complete forcing numbers of hexagonal systems. II
- Single coronoid systems with an anti-forcing edge
- Counting clar structures of \((4,6)\)-fullerenes
- The complexity of the Clar number problem and an exact algorithm
This page was built for publication: A min-max theorem for plane bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968154)
