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)
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
Cites work
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 4083653 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1187153 (Why is no real title available?)
- scientific article; zbMATH DE number 1522741 (Why is no real title available?)
- scientific article; zbMATH DE number 4189780 (Why is no real title available?)
- A min-max result on catacondensed benzenoid graphs
- A min-max result on outerplane bipartite graphs
- Algebraic Characterizations of Unimodular Matrices
- Unimodularity of the Clar number problem
Cited in
(14)- Complete forcing numbers of \((4, 6)\)-fullerenes
- A network flow approach to a common generalization of Clar and Fries numbers
- Unimodularity of the Clar number problem
- scientific article; zbMATH DE number 165076 (Why is no real title available?)
- A min-max result on outerplane bipartite graphs
- Counting clar structures of \((4,6)\)-fullerenes
- Complete forcing numbers of complete and almost-complete multipartite graphs
- Complete forcing numbers of graphs
- The complexity of the Clar number problem and an exact algorithm
- A min-max property of chordal bipartite graphs with applications
- Complete forcing numbers of hexagonal systems. II
- Single coronoid systems with an anti-forcing edge
- Minimum balanced bipartitions of planar triangulations
- Complete forcing numbers of hexagonal systems
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)
