Maximal sets of 2-factors and Hamiltonian cycles

DOI10.1006/jctb.1993.1006zbMath0767.05072OpenAlexW1997636318MaRDI QIDQ1204483

D. G. Hoffman, C. A. Rodger, Alexander Rosa

Publication date: 10 March 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1993.1006

zbMATH Keywords

regular graphsHamiltonian cyclesfactorsmaximal set

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

Indecomposable triple systems exist for all lambda ⋮ Maximal sets of Hamilton cycles in complete multipartite graphs. IV ⋮ Unnamed Item ⋮ Neighborhoods in Maximum Packings of 2K_nand Quadratic Leaves of Triple Systems ⋮ Maximal sets of Hamilton cycles inKn,n ⋮ Maximal edge colorings of graphs ⋮ Maximal sets of Hamilton cycles in \(K_{2p}-F\) ⋮ Maximal sets of Hamilton cycles in \(D_n\) ⋮ Hamilton decompositions of balanced complete multipartite graphs with primitive leaves ⋮ Two-factorizations of small complete graphs ⋮ Hamilton decompositions of graphs with primitive complements ⋮ Maximal sets of Hamilton cycles in \(K \left( n^r ; \lambda_1 , \lambda_2\right)\) ⋮ Regular factors of simple regular graphs and factor-spectra

This page was built for publication: Maximal sets of 2-factors and Hamiltonian cycles