Maximal sets of Hamilton cycles inKn,n

DOI<25::AID-JGT3>3.0.CO;2-T 10.1002/(SICI)1097-0118(200001)33:1<25::AID-JGT3>3.0.CO;2-TzbMath0946.05052OpenAlexW3095440407MaRDI QIDQ4944682

Darryn E. Bryant, C. A. Rodger, Saad I. El-Zanati

Publication date: 18 October 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200001)33:1<25::aid-jgt3>3.0.co;2-t

zbMATH Keywords

maximalhamiltoniancomplete bipartite

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Maximal sets of Hamilton cycles in complete multipartite graphs. IV ⋮ Maximal sets of Hamilton cycles in \(K_{2p}-F\) ⋮ Maximal sets of Hamilton cycles in \(D_n\) ⋮ Unnamed Item ⋮ Maximal sets of Hamilton cycles in \(K \left( n^r ; \lambda_1 , \lambda_2\right)\)

Cites Work

• Unnamed Item
• Hamiltonian decompositions of complete graphs
• Longest cycles in triangle-free graphs
• The embedding of partial triple systems when 4 divides \(\lambda\)
• The spectrum of maximal sets of one-factors
• Maximal sets of 2-factors and Hamiltonian cycles
• Hamilton cycles in 2-connected regular bipartite graphs
• On Hamilton's ideals
• Maximal sets of triangle-factors onv = 6m vertices
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1

This page was built for publication: Maximal sets of Hamilton cycles inKn,n