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 - 3 / 3
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
On the Hamilton-Waterloo Problem with a single factor of 6-cycles
Zazil Santizo Huerta, Melissa Keranen, 2026, izvirni znanstveni članek

Opis: The uniform Hamilton-Waterloo Problem (HWP) asks for a resolvable (CM, CN)-decomposition of Kv into α CM-factors and β CN-factors. We denote a solution to the uniform Hamilton-Waterloo problem by HWP(v; M, N; α, β). Our research concentrates on addressing some of the remaining unresolved cases, which pose a significant challenge to generalize. We place a particular emphasis on instances where the gcd (M, N) = {2, 3}, with a specific focus on the parameter M = 6. We introduce modifications to some known structures, and develop new approaches to resolving these outstanding challenges in the construction of uniform 2-factorizations. This innovative method not only extends the scope of solved cases, but also contributes to a deeper understanding of the complexity involved in solving the Hamilton-Waterloo Problem.
Ključne besede: 2-factorizations, Hamilton-Waterloo problem, Oberwolfach problem, cycle decomposition, resolvable decompositions
Objavljeno v RUP: 11.08.2026; Ogledov: 354; Prenosov: 11
.pdf Celotno besedilo (526,92 KB)

2.
Decompositions of the wreath product of certain directed graphs into directed hamiltonian cycles
Alice Lacaze-Masmonteil, 2026, izvirni znanstveni članek

Opis: We affirm several special cases of a conjecture that first appears in Alspach et al. (1987) which stipulates that the wreath (lexicographic) product of two hamiltonian decomposable di- rected graphs is also hamiltonian decomposable. Specifically, we show that the wreath product of hamiltonian decomposable directed graph G, such that |V (G)| is even and |V (G)| ⩾ 3, with a directed m-cycle such that m ⩾ 4 or the complete symmetric directed graph on m vertices such that m ⩾ 3, is hamiltonian decomposable. We also show the wreath product of a directed n-cycle, where n is even, with a directed m-cycle, where m ∈ {2, 3}, is not hamiltonian decomposable.
Ključne besede: wreath product, decompositions, hamiltonian cycle, directed graphs
Objavljeno v RUP: 17.03.2026; Ogledov: 676; Prenosov: 44
.pdf Celotno besedilo (538,63 KB)

3.
6-decomposition of snarks
Ján Karabáš, Edita Máčajová, Roman Nedela, 2013, izvirni znanstveni članek

Ključne besede: dekompozicije, graf, barvanje, decompositions, graphs, coloring
Objavljeno v RUP: 15.10.2015; Ogledov: 5616; Prenosov: 116
URL Povezava na celotno besedilo

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