| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Naslov: 1-factors and characterization of reducible faces of plane elementary bipartite graphs Taranenko, Andrej (Avtor)Vesel, Aleksander (Avtor) Discussiones_Mathematicae_Graph_Theory_2012_Taranenko,_Vesel_1-factors_and_characterization_of_reducible_faces_of_plane_elementary_bipar.pdf (139,73 KB)MD5: A21F6AD1F503FB243A47293022A1E0AC  http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1607 Angleški jezik Znanstveno delo (r2) 1.01 - Izvirni znanstveni članek FNM - Fakulteta za naravoslovje in matematiko 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 2012 str. 289-297 št. 2, Letn. 32 1234-3099 519.17 19104264 10.7151/dmgt.1607 1234-3099 URN:SI:UM:DK:HUQUGRZ5 543 294 Ostalo

Skupna ocena: (0 glasov) Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. AddThis uporablja piškotke, za katere potrebujemo vaše privoljenje.Uredi privoljenje...

Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Naslov: Discussiones Mathematicae. Graph Theory Discuss. Math., Graph Theory De Gruyter Open 1234-3099 7487065

## Licence

Licenca: CC BY-NC-ND 4.0, Creative Commons Priznanje avtorstva-Nekomercialno-Brez predelav 4.0 Mednarodna http://creativecommons.org/licenses/by-nc-nd/4.0/deed.sl Najbolj omejujoča licenca Creative Commons. Uporabniki lahko prenesejo in delijo delo v nekomercialne namene in ga ne smejo uporabiti za nobene druge namene. 31.03.2017

## Sekundarni jezik

Jezik: Slovenski jezik matematika, teorija grafov, elementarni dvodelni graf, reducibilno lice, benzenoidni graf

## Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)
 0 - 0 / 0 Ni komentarjev!

Nazaj