Packing and covering of the complete graph with a graph G of four vertices or less

zbMath0521.05053MaRDI QIDQ1055440

Yehuda Roditty

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

graph covering problemgraph packing problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Coverings of a complete graph with five-vertex and five-edge graphs, Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges, The spectrum of optimal excess graphs for trees with up to four edges, Unnamed Item, Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord., Maximum packing for perfect four-triple configurations, A subspace covering problem in the \(n\)-cube, Packing of \(K_{v}\) with certain graphs of five vertices, Unnamed Item, Covering graphs: The covering problem solved

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal coverings of pairs by triples
• On the decomposition of a graph into stars
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• Graphs with forbidden subgraphs
• On the covering of pairs by quadruples. I
• On the covering of pairs by quadruples. II
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Decomposition of complete graphs into stars