| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Naslov: Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs Taranenko, Andrej (Avtor)Vesel, Aleksander (Avtor) http://dx.doi.org/10.1016/j.dam.2007.08.029 Angleški jezik Neznano () 1.01 - Izvirni znanstveni članek FNM - Fakulteta za naravoslovje in matematiko A benzenoid graph is a finite connected plane graph with no cut vertices in which every interior region is bounded by a regular hexagon of a side length one. A benzenoid graph G is elementary if every edge belongs to a 1-factor of G. A hexagon h of an elementary benzenoid graph is reducible, if the removal of boundary edges and vertices of h results in an elementary benzenoid graph. We characterize the reducible hexagons of an elementary benzenoid graph. The characterization is the basis for an algorithm which finds the sequence of reducible hexagons that decompose a graph of this class in ▫$O(n^2)$▫ time. Moreover, we present an algorithm which decomposes an elementary benzenoid graph with at most one pericondensed component in linear time. mathematics, graph theory, benzenoid graphs, 1-factor, hexagons, reducible hexagons, reducible face decomposition 2008 519.17 16140552 0166-218X URN:SI:UM:DK:VMCNDQJE 1301 73 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: Discrete applied mathematics Discrete appl. math. Elsevier 0166-218X 25342464

## Sekundarni jezik

Jezik: Angleški jezik matematika, teorija grafov, benzenoidni grafi, 1-faktor, šestkotniška mreža

## Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

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

Nazaj