Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph
From MaRDI portal
Publication:981678
DOI10.1007/s11083-010-9139-3zbMath1193.05136MaRDI QIDQ981678
Publication date: 2 July 2010
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-010-9139-3
05C90: Applications of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
06D05: Structure and representation theory of distributive lattices
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
Related Items
Binary Coding of Resonance Graphs of Catacondensed Polyhexes, Distributive lattice structure on the set of perfect matchings of carbon nanotubes, Non-matchable distributive lattices, Distance between \(\alpha\)-orientations of plane graphs by facial cycle reversals, Decomposition theorem on matchable distributive lattices
Cites Work
- The rotation graphs of perfect matchings of plane bipartite graphs
- Matching theory
- Matching structure and the matching lattice
- Combinatorics of perfect matchings in plane bipartite graphs and application to tilings.
- A distributive lattice on the set of perfect matchings of a plane bipartite graph
- \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs
- Plane elementary bipartite graphs
- Resonance graphs of catacondensed even ring systems are median
- Z-transformation graphs of perfect matchings of hexagonal systems
- Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs
- Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item