On the perfect one-factorization conjecture
From MaRDI portal
Publication:1196999
DOI10.1016/0012-365X(92)90337-FzbMath0780.05047WikidataQ123331648 ScholiaQ123331648MaRDI QIDQ1196999
Publication date: 16 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
Generalized arboricity of graphs with large girth, A quantitative approach to perfect one-factorizations of complete bipartite graphs, Acyclic edge colorings of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A perfect one-factorization for \(K_{36}\)
- Perfect one-factorizations of \(K_{1332}\) and \(K_{6860}\)
- One-factorizations of the complete graph—A survey
- Some new perfect one-factorizations from starters in finite fields
- An Existence Theorem for Room Squares*