The \(Z\)-transformation graph for an outerplane bipartite graph has a Hamilton path.

DOI10.1016/j.am1.2003.12.002zbMath1057.05071OpenAlexW1968943545MaRDI QIDQ1767144

Haiyuan Yao, Lingbo Zhao, Heping Zhang

Publication date: 7 March 2005

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

Full work available at URL: https://doi.org/10.1016/j.am1.2003.12.002

zbMATH Keywords

Hamilton path\(Z\)-transformation graphPerfect matchingBipartite graphOuterplane graphPlane graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

A min-max result on outerplane bipartite graphs ⋮ A characterization of the resonance graph of an outerplane bipartite graph ⋮ On plane bipartite graphs without fixed edges ⋮ Structure and enumeration results of matchable Lucas cubes

Cites Work

• Unnamed Item
• Unnamed Item
• The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems
• Matching theory
• Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems
• A distributive lattice on the set of perfect matchings of a plane bipartite graph
• Plane elementary bipartite graphs
• Resonance graphs of catacondensed even ring systems are median
• The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes
• Z-transformation graphs of perfect matchings of hexagonal systems
• A min-max result on catacondensed benzenoid graphs
• Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs

This page was built for publication: The \(Z\)-transformation graph for an outerplane bipartite graph has a Hamilton path.