Packings in bipartite prisms and hypercubes
DOI10.1016/j.disc.2024.113875arXiv2309.04963OpenAlexW4390891836WikidataQ130082932 ScholiaQ130082932MaRDI QIDQ6197743
Douglas F. Rall, Sandi Klavžar, Boštjan Brešar
Publication date: 19 February 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2309.04963
hypercubetotal domination numberinjective coloring2-packing numberopen packing numberbipartite prism
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Efficient domination in cubic vertex-transitive graphs
- (Total) domination in prisms
- Relations between packing and covering numbers of a tree
- On the injective chromatic number of graphs
- Some results on the injective chromatic number of graphs
- Further results on packing related parameters in graphs
- Independent domination in hypercubes
- Total domination and open packing in some chemical graphs
- Injective coloring of some subclasses of bipartite graphs and chordal graphs
- Injective coloring of graphs revisited
- Proof of the middle levels conjecture
- (Open) packing number of some graph products
- Improved sphere bounds on the covering radius of codes
- On the size of optimal binary codes of length 9 and covering radius 1
- Domination in Graphs: Core Concepts
- A note on the open packing number in graphs
- Total Domination in Categorical Products of Graphs
- Acyclic, star, and injective colouring: bounding the diameter
This page was built for publication: Packings in bipartite prisms and hypercubes
