Packing and Covering of the Complete Graph with 4-Cycles*

DOI10.4153/CMB-1975-123-4zbMath0322.05139MaRDI QIDQ4083482

Arie Bialostocki, J. Schönheim

Publication date: 1975

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Combinatorial aspects of packing and covering (05B40)

Related Items (22)

Coverings of a complete graph with five-vertex and five-edge graphs ⋮ Maximum packings of the complete graph with uniform length cycles ⋮ Unnamed Item ⋮ Packings and Coverings of the Complete Bipartite Graph by Octagons ⋮ Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles ⋮ The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles ⋮ \(\vec C_4\)-decompositions of \(D_v\backslash P\) and \(D_{v}\cup P\) where \(P\) is a 2-regular subgraph of \(D_{v}\) ⋮ Almost resolvable maximum packings of complete graphs with 5-cycles ⋮ Unnamed Item ⋮ Common multiples of complete graphs and a 4-cycle ⋮ Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord. ⋮ Packings and coverings of various complete graphs with the 4-cycle with a pendant edge ⋮ Almost resolvable maximum packings of complete graphs with 4-cycles ⋮ Packing cycles in complete graphs ⋮ A subspace covering problem in the \(n\)-cube ⋮ Packing of \(K_{v}\) with certain graphs of five vertices ⋮ Maximum packings and minimum coverings of \(K_{v}\) with octagons ⋮ Enclosings of \(\lambda \)-fold 4-cycle systems ⋮ Zerlegung total gerichteter Graphen in Kreise ⋮ Unnamed Item ⋮ Covering graphs: The covering problem solved ⋮ Packing and covering of the complete graph with a graph G of four vertices or less

This page was built for publication: Packing and Covering of the Complete Graph with 4-Cycles^*