The complete graph \(t\)-packings and \(t\)-coverings
From MaRDI portal
Publication:1313352
DOI10.1007/BF02988322zbMath0795.05116MaRDI QIDQ1313352
Publication date: 26 January 1994
Published in: Graphs and Combinatorics (Search for Journal in Brave)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition of \(K_n\) into subgraphs of prescribed type
- Embedding graphs of small size
- Graphs self-complementary in \(K_ n-e\)
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Selbstkomplementäre Graphen
- Isomorphic factorizations VII. Regular graphs and tournaments
- Isomorphic factorizations of complete equipartite graphs
- Isomorphic Factorisations. I: Complete Graphs