scientific article; zbMATH DE number 3397564
From MaRDI portal
Publication:5665207
Cited in
(21)- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- New lower bound on the Shannon capacity of \(C_7\) from circular graphs
- Improved lower bound on the Shannon capacity of C₇
- On the Shannon capacity of triangular graphs
- On zero-error codes produced by greedy algorithms
- Semidefinite programming bounds for Lee codes
- New lower bounds for the Shannon capacity of odd cycles
- Numerical invariants and the strong product of graphs
- Covering tori with squares
- On the independence number of some strong products of cycle-powers
- On the independence numbers of the cubes of odd cycles
- scientific article; zbMATH DE number 1366757 (Why is no real title available?)
- scientific article; zbMATH DE number 4120174 (Why is no real title available?)
- The longest segment in the complement of a packing
- Independent sets in graphs
- A special combinatorial problem: pitch arrangement for pneumatic tires
- Filling space with hypercubes of two sizes – The pythagorean tiling in higher dimensions
- The board packing problem
- Covering three-tori with cubes
- On the ratio of Shannon numbers of graphs
- Consequences of the packing problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5665207)
