Title of article
Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs Original Research Article
Author/Authors
Andrej Taranenko، نويسنده , , Aleksander Vesel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
14
From page
1711
To page
1724
Abstract
A benzenoid graph is a finite connected plane graph with no cut vertices in which every interior region is bounded by a regular hexagon of a side length one. A benzenoid graph G is elementary if every edge belongs to a 1-factor of G. A hexagon h of an elementary benzenoid graph is reducible, if the removal of boundary edges and verti
Keywords
Reducible face decomposition , Benzenoid graph , Reducible hexagon , 1-factor
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886773
Link To Document