On perfect one-factorization of the complete graph \(K_{2p}\)

DOI10.1007/BF01788690zbMath0708.05047MaRDI QIDQ920115

Midori Kobayashi

Publication date: 1989

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian circuit1-factorizationperfect factorization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Structured Codes of Graphs ⋮ A new neighborhood structure for round robin scheduling problems ⋮ Perfect one-factorizations arising from the Lee metric ⋮ On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)

Cites Work

• Finite topologies and Hamiltonian paths
• Symmetry groups of some perfect 1-factorizations of complete graphs