20.500.12556/DKUM-65331 1-factors and characterization of reducible faces of plane elementary bipartite graphs 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. mathematics graph theory plane elementary bipartite graph reducible face benzenoid graph matematika teorija grafov elementarni dvodelni graf reducibilno lice benzenoidni graf true true true University Zielona Góra Angleški jezik Slovenski jezik Znanstveno delo 2017-03-31 09:55:18 2017-03-31 09:56:28 2026-04-09 13:54:41 2019-07-11 15:14:49 2012 0 0 str. 289-297 št. 2 Letn. 32 2012 0000-00-00 Zaloznikova Objavljeno NiDoloceno 2010-11-30 2011-05-11 2011-05-24 1234-3099 519.17 7487065 19104264 10.7151/dmgt.1607 1234-3099 URN:SI:UM:DK:HUQUGRZ5 Discussiones_Mathematicae_Graph_Theory_2012_Taranenko,_Vesel_1-factors_and_characterization_of_reducible_faces_of_plane_elementary_bipar.pdf Discussiones_Mathematicae_Graph_Theory_2012_Taranenko,_Vesel_1-factors_and_characterization_of_reducible_faces_of_plane_elementary_bipar.pdf 1 A21F6AD1F503FB243A47293022A1E0AC e466ae65a482140c9ce22bd5b4a70a8f946dc80bc4c54ab72a3f1f5ec79f1191 0b198a9c-7c0e-11eb-bb7a-00155d0001ca https://dk.um.si/Dokument.php?lang=slv&id=110388 http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1607 1 https://dk.um.si/Dokument.php?lang=slv&id=110387 Fakulteta za naravoslovje in matematiko 0 0 0