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

DOI10.1016/0898-1221(88)90211-8zbMATH Open0645.05058OpenAlexW1608119071MaRDI QIDQ1102983FDOQ1102983

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1355295
• scientific article; zbMATH DE number 4105008
• scientific article; zbMATH DE number 15160
• Packing and covering immersion-expansions of planar sub-cubic graphs
• On hypercube packings, blocking sets and a covering problem
• On packing and covering numbers of graphs
• Packing and covering immersion models of planar subcubic graphs
• On packing \(S\)-colorings of subcubic graphs
• Covering and packing problems in lattices associated with the \(n\)-cube
• Constructions of optimal packing and covering of the complete multigraph with applications

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)

Cites Work

• Title not available (Why is that?)
• Covering and packing in graphs IV: Linear arboricity
• COVERING AND PACKING IN GRAPHS, I.
• Maximum versus minimum invariants for graphs

Cited In (7)

• Packing lines in a hypercube
• Clumsy packings of graphs
• Packing the hypercube
• Partitioning the vertices of a torus into isomorphic subgraphs
• Packings in bipartite prisms and hypercubes
• On hypercube packings, blocking sets and a covering problem
• Three ways to cover a graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102983)