A min-max result on outerplane bipartite graphs
From MaRDI portal
Publication:868015
DOI10.1016/j.aml.2006.03.014zbMath1109.05101OpenAlexW2095508334MaRDI QIDQ868015
Haiyuan Yao, Dewu Yang, Heping Zhang
Publication date: 19 February 2007
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2006.03.014
Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items
A minimax result for perfect matchings of a polyomino graph, Decomposition theorem on matchable distributive lattices, Anti-forcing spectrum of any cata-condensed hexagonal system is continuous, A min-max theorem for plane bipartite graphs, Complete forcing numbers of hexagonal systems
Cites Work
- Unnamed Item
- Unnamed Item
- Matching theory
- A distributive lattice on the set of perfect matchings of a plane bipartite graph
- Plane elementary bipartite graphs
- The \(Z\)-transformation graph for an outerplane bipartite graph has a Hamilton path.
- Z-transformation graphs of perfect matchings of hexagonal systems
- A min-max result on catacondensed benzenoid graphs
