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

05C35: Extremal problems in graph theory

05C99: Graph theory

05B40: Combinatorial aspects of packing and covering

Related Items

Unnamed Item, Unnamed Item, Packings and Coverings of the Complete Bipartite Graph by Octagons, Unnamed Item, Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles, A subspace covering problem in the \(n\)-cube, Almost resolvable maximum packings of complete graphs with 4-cycles, Packing of \(K_{v}\) with certain graphs of five vertices, \(\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, Packing cycles in complete graphs, Maximum packings and minimum coverings of \(K_{v}\) with octagons, Enclosings of \(\lambda \)-fold 4-cycle systems, Packing and covering of the complete graph with a graph G of four vertices or less, Zerlegung total gerichteter Graphen in Kreise, Covering graphs: The covering problem solved, The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles, Common multiples of complete graphs and a 4-cycle, Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord., Coverings of a complete graph with five-vertex and five-edge graphs, Packings and coverings of various complete graphs with the 4-cycle with a pendant edge, Maximum packings of the complete graph with uniform length cycles