ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Discussiones Mathematicae Graph Theory 32(2) (2012)
Faculty of Natural Sciences and Mathematics University of Maribor Koroška cesta 160, 2000 Maribor, Slovenia
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.
Keywords: plane elementary bipartite graph, reducible face, perfect matching, 1-factor, benzenoid graph
2010 Mathematics Subject Classification: 05C70.
Received 30 November 2010 Revised 11 May 2011 Accepted 24 May 2011