Počet záznamov: 1
Covering spaces of locally homogeneous graphs
Názov Covering spaces of locally homogeneous graphs Aut.údaje Roman Nedela, Martin Škoviera Autor Nedela Roman 1960- (50%) UMBFP12 - Inštitút matematiky a informatiky
Spoluautori Škoviera Martin (50%)
Zdroj.dok. Discrete mathematics. Vol. 121, no. 1-3 (1993), pp. 177-188. - Amsterdam : Elsevier Science BV, 1993 Kľúč.slová matematika - mathematics grafy - charts - graphs Jazyk dok. angličtina Krajina Holandsko Systematika 51 Anotácia A graph G is called locally homogeneous, or locally G0, if for each vertex u of G the subgraph induced on the set of vertices adjacent with u is isomorphic to some graph G0. In this paper we use the concept of covering spaces for deriving various results on the set of all connected locally G0 graphs (for given G0). For instance, we prove that if e(G0) is small and there exists a locally G0 graph, then there are infinitely many finite connected locally G0 graphs. Further, a sufficient condition for existence of an infinite locally G0 graph given in terms of minors of G is presented. As a by-product, we obtain a characterization of contraction minimal locally cyclic triangulations of the projective plane, which is also interesting for its own sake. Kategória publikačnej činnosti ADE Číslo archívnej kópie 28520 Kategória ohlasu ORLOVICH, Yu. L. Coverings by cliques, factors and graphs with isomorphic vertex neighborhoods. In Diskretnyj analiz i issledovanie operacii. 2002, vol. 9, no. 2, pp. 48-90.
Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ 
článok
Počet záznamov: 1