Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 10 / 30
Na začetekNa prejšnjo stran123Na naslednjo stranNa konec
1.
On girth-biregular graphs
György Kiss, Štefko Miklavič, Tamás Szőnyi, 2023, izvirni znanstveni članek

Ključne besede: girth cycle, girth-biregular graph, steiner system, generalized polygons
Objavljeno v RUP: 06.11.2023; Ogledov: 240; Prenosov: 3
.pdf Celotno besedilo (429,83 KB)

2.
A novel characterization of cubic Hamiltonian graphs via the associated quartic graphs
Simona Bonvicini, Tomaž Pisanski, 2017, izvirni znanstveni članek

Opis: We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is most useful in the case when it induces a blue and red 2-factorization of the associated quartic graph. We use this condition to characterize the Hamiltonian ▫$I$▫-graphs, a further generalization of generalized Petersen graphs. The characterization of Hamiltonian ▫$I$▫-graphs follows from the fact that one can choose a 1-factor in any ▫$I$▫-graph in such a way that the corresponding associated quartic graph is a graph bundle having a cycle graph as base graph and a fiber and the fundamental factorization of graph bundles playing the role of blue and red factorization. The techniques that we develop allow us to represent Cayley multigraphs of degree 4, that are associated to abelian groups, as graph bundles. Moreover, we can find a family of connected cubic (multi)graphs that contains the family of connected ▫$I$▫-graphs as a subfamily.
Ključne besede: generalized Petersen graphs, I-graphs, Hamiltonian cycles, Eulerian tours, Cayley multigraphs
Objavljeno v RUP: 03.01.2022; Ogledov: 746; Prenosov: 16
.pdf Celotno besedilo (1,01 MB)

3.
Fast recognition of some parametric graph families
Nina Klobas, Matjaž Krnc, 2021, objavljeni znanstveni prispevek na konferenci

Ključne besede: I-graphs, double generalized Petersen graphs, folded cubes, recognition algorithm, cycle regularity
Objavljeno v RUP: 18.10.2021; Ogledov: 1025; Prenosov: 23
URL Povezava na celotno besedilo

4.
5.
6.
7.
8.
9.
Recognizing generalized Petersen graphs in linear time
Matjaž Krnc, Robin J. Wilson, 2020, kratki znanstveni prispevek

Ključne besede: graph recognition, generalized Petersen graphs, linear algorithms
Objavljeno v RUP: 29.04.2020; Ogledov: 1496; Prenosov: 141
URL Povezava na celotno besedilo
Gradivo ima več datotek! Več...

10.
Iskanje izvedeno v 0.06 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici