Forcing faces in plane bipartite graphs

DOI10.1016/j.disc.2007.05.025zbMath1168.05357OpenAlexW2071066446MaRDI QIDQ2427502

Zhibo Chen, Zhongyuan Che

Publication date: 13 May 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.05.025

zbMATH Keywords

perfect matchingplane bipartite graph\(Z\)-transformation graphreducible face decompositionforcing faceplane elementary bipartite graphforcing edge

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Structural properties of resonance graphs of plane elementary bipartite graphs ⋮ Peripheral convex expansions of resonance graphs ⋮ Even cycles and perfect matchings in claw-free plane graphs ⋮ Plane elementary bipartite graphs with forcing or anti-forcing edges ⋮ Cube-free resonance graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• On minimal elementary bipartite graphs
• Plane elementary bipartite graphs
• Z-transformation graphs of perfect matchings of hexagonal systems
• Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs
• Matching transformation graphs of cubic bipartite plane graphs
• Hexagonal systems with forcing edges

This page was built for publication: Forcing faces in plane bipartite graphs