1-factors and characterization of reducible faces of plane elementary bipartite graphs
Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 2, pp. 289-297

Voir la notice de l'article provenant de la source Library of Science

As a general case of molecular graphs of benzenoid hydrocarbons, we study plane bipartite graphs with Kekulé structures (1-factors). A bipartite graph G is called elementary if G is connected and every edge belongs to a 1-factor of G. Some properties of the minimal and the maximal 1-factor of a plane elementary graph are given.
Keywords: plane elementary bipartite graph, reducible face, perfect matching, 1-factor, benzenoid graph
@article{DMGT_2012_32_2_a8,
     author = {Taranenko, Andrej and Vesel, Aleksander},
     title = {1-factors and characterization of reducible faces of plane elementary bipartite graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {289--297},
     publisher = {mathdoc},
     volume = {32},
     number = {2},
     year = {2012},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a8/}
}
TY  - JOUR
AU  - Taranenko, Andrej
AU  - Vesel, Aleksander
TI  - 1-factors and characterization of reducible faces of plane elementary bipartite graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2012
SP  - 289
EP  - 297
VL  - 32
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a8/
LA  - en
ID  - DMGT_2012_32_2_a8
ER  - 
%0 Journal Article
%A Taranenko, Andrej
%A Vesel, Aleksander
%T 1-factors and characterization of reducible faces of plane elementary bipartite graphs
%J Discussiones Mathematicae. Graph Theory
%D 2012
%P 289-297
%V 32
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a8/
%G en
%F DMGT_2012_32_2_a8
Taranenko, Andrej; Vesel, Aleksander. 1-factors and characterization of reducible faces of plane elementary bipartite graphs. Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 2, pp. 289-297. http://geodesic.mathdoc.fr/item/DMGT_2012_32_2_a8/