Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs

DOI10.1016/j.dam.2007.08.029zbMath1152.05382MaRDI QIDQ944724

Andrej Taranenko, Aleksander Vesel

Publication date: 10 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.029

zbMATH Keywords

1-factor; benzenoid graph; reducible face decomposition; reducible hexagon

Mathematics Subject Classification ID

05C90: Applications of graph theory

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

Related Items

Structural properties of resonance graphs of plane elementary bipartite graphs, Regular coronoids and 4-tilings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The rotation graphs of perfect matchings of plane bipartite graphs
• Matching theory
• When each hexagon of a hexagonal system covers it
• On minimal elementary bipartite graphs
• A linear algorithm for perfect matching in hexagonal systems
• 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 enumeration of several classes of hexagonal systems
• Z-transformation graphs of perfect matchings of hexagonal systems
• Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems
• Perfect matchings in hexagonal systems