The complete graph t-packings and t-coverings
From MaRDI portal
Publication:1313352
DOI10.1007/BF02988322zbMATH Open0795.05116MaRDI QIDQ1313352FDOQ1313352
Authors: Zdzisław Skupień
Publication date: 26 January 1994
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
- Packing and covering the balanced complete bipartite multigraph with cycles and stars
- Maximum packings and minimum coverings of multigraphs with paths and stars
- scientific article; zbMATH DE number 1156587
- scientific article; zbMATH DE number 734481
- Optimal packings and coverings of complete multigraph \(\lambda {K_v}\) with four kinds of graphs
Cites Work
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Selbstkomplementäre Graphen
- Title not available (Why is that?)
- Graphs self-complementary in \(K_ n-e\)
- Title not available (Why is that?)
- Isomorphic Factorisations. I: Complete Graphs
- Title not available (Why is that?)
- Decomposition of \(K_n\) into subgraphs of prescribed type
- Isomorphic factorizations VII. Regular graphs and tournaments
- Title not available (Why is that?)
- Isomorphic factorizations of complete equipartite graphs
- Embedding graphs of small size
- Title not available (Why is that?)
Cited In (12)
- Decompositions, packings and coverings of the complete digraph with orientations of \(K_3 \cup \{e\}\)
- Packing of graphs and permutations -- a survey
- Packings and perfect path double covers of maximal planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition of a \(2K_{10t}\) into \(H_3\) graphs.
- On a theorem of Mader
- Packing and covering the balanced complete bipartite multigraph with cycles and stars
- Maximum packings and minimum coverings of multigraphs with paths and stars
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: The complete graph \(t\)-packings and \(t\)-coverings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313352)