TITLE

1-FACTORS AND CHARACTERIZATION OF REDUCIBLE FACES OF PLANE ELEMENTARY BIPARTITE GRAPHS

AUTHOR(S)
TARANENKO, ANDREJ; VESEL, ALEKSANDER
PUB. DATE
May 2012
SOURCE
Discussiones Mathematicae: Graph Theory;2012, Vol. 32 Issue 2, p289
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
As a general case of molecular graphs of benzenoid hydrocarbons, we study plane bipartite graphs with Kekul'e 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 re- moval 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 gen- eralizes the characterization of reducible faces of an elementary benzenoid graph.
ACCESSION #
86440294

 

Related Articles

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics