On plane bipartite graphs without fixed edges

DOI10.1016/j.aml.2006.08.014zbMath1131.05075OpenAlexW2021727587MaRDI QIDQ2470336

Sandi Klavžar, Khaled Salem

Publication date: 14 February 2008

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

Full work available at URL: https://doi.org/10.1016/j.aml.2006.08.014

zbMATH Keywords

fixed edgeperfect matchingplane bipartite graphalternating cyclegeneralized hexagonal systempolyhex fragment

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• When each hexagon of a hexagonal system covers it
• Generalized hexagonal systems with each hexagon being resonant
• \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs
• 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
• On the role of hypercubes in the resonance graphs of benzenoid graphs

This page was built for publication: On plane bipartite graphs without fixed edges