Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs
type: Item
instance of: scholarly article
title: Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs
zbMATH Open document ID: 1152.05382
author: Andrej Taranenko
author: Aleksander Vesel
published in: Discrete Applied Mathematics
publication date: 2008-09-10T00:00:00Z
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 92E10
zbMATH DE Number: 5324146
zbMATH Keywords: benzenoid graph
zbMATH Keywords: 1-factor
zbMATH Keywords: reducible hexagon
zbMATH Keywords: reducible face decomposition
MaRDI profile type: Publication
full work available at URL: j.dam.2007.08.029
OpenAlex ID: W2155673339
cites work: Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems
cites work: Q3813828
cites work: Q5753988
cites work: A linear algorithm for perfect matching in hexagonal systems
cites work: Q4523707
cites work: Q3369056
cites work: Resonance graphs of catacondensed even ring systems are median
cites work: Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems
cites work: A distributive lattice on the set of perfect matchings of a plane bipartite graph
cites work: On minimal elementary bipartite graphs
cites work: Matching theory
cites work: Perfect matchings in hexagonal systems
cites work: Q5714888
cites work: When each hexagon of a hexagonal system covers it
cites work: The enumeration of several classes of hexagonal systems
cites work: Z-transformation graphs of perfect matchings of hexagonal systems
cites work: The rotation graphs of perfect matchings of plane bipartite graphs
cites work: Plane elementary bipartite graphs
DOI: 10.1016/J.DAM.2007.08.029
description: scientific article; zbMATH DE number 5324146