Covering and packing in graphs. V. Mispacking subcubes in hypercubes

DOI10.1016/0898-1221(88)90211-8zbMath0645.05058OpenAlexW1608119071MaRDI QIDQ1102983

Niall Graham, Frank Harary

Publication date: 1988

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(88)90211-8

zbMATH Keywords

subgraphmispackingmispacking numbersnode-disjoint packing of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Three ways to cover a graph ⋮ Packing the hypercube

Cites Work

• Unnamed Item
• Maximum versus minimum invariants for graphs
• Covering and packing in graphs IV: Linear arboricity
• COVERING AND PACKING IN GRAPHS, I.

This page was built for publication: Covering and packing in graphs. V. Mispacking subcubes in hypercubes