- Tytuł:
- 1-factors and characterization of reducible faces of plane elementary bipartite graphs
- Autorzy:
-
Taranenko, Andrej
Vesel, Aleksander - Powiązania:
- https://bibliotekanauki.pl/articles/743201.pdf
- Data publikacji:
- 2012
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
plane elementary bipartite graph
reducible face
perfect matching
1-factor
benzenoid graph - Opis:
-
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.
A peripheral face f of a plane elementary graph is reducible, if the removal of the internal vertices and edges of the path that is the intersection of f and the outer cycle of G results in an elementary graph. We characterize the reducible faces of a plane elementary bipartite graph. This result generalizes the characterization of reducible faces of an elementary benzenoid graph. - Źródło:
-
Discussiones Mathematicae Graph Theory; 2012, 32, 2; 289-297
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł