The nonexistence of a (K6-e)-decomposition of the complete graphK29
From MaRDI portal
Publication:3576966
DOI10.1002/jcd.20226zbMath1216.05113OpenAlexW2008665283MaRDI QIDQ3576966
Darryn E. Bryant, Stephen G. Hartke, Patric R. J. Östergård, Saad I. El-Zanati
Publication date: 3 August 2010
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20226
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
There is no McLaughlin geometry ⋮ On the non-existence of pair covering designs with at least as many points as blocks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dynamic survey of graph labeling
- On the non-existence of pair covering designs with at least as many points as blocks
- The Non-Existence of Finite Projective Planes of Order 10
- A survey on the existence ofG-Designs
- On Rosa-type labelings and cyclic graph decompositions
- Combinatorial Problems
- The Nonexistence of Certain Finite Projective Planes
This page was built for publication: The nonexistence of a (K6-e)-decomposition of the complete graphK29