Number of the records: 1
Covering spaces of locally homogeneous graphs
Title Covering spaces of locally homogeneous graphs Author info Roman Nedela, Martin Škoviera Author Nedela Roman 1960- (50%) UMBFP12 - Inštitút matematiky a informatiky
Co-authors Škoviera Martin (50%)
Source document Discrete mathematics. Vol. 121, no. 1-3 (1993), pp. 177-188. - Amsterdam : Elsevier Science BV, 1993 Keywords matematika - mathematics grafy - charts - graphs Language English Country Netherlands systematics 51 Annotation 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. Public work category ADE No. of Archival Copy 28520 Repercussion category 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.
Catal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Database xpca - PUBLIKAČNÁ ČINNOSŤ 
article
Number of the records: 1