Every grid has an independent [1, 2]-set
From MaRDI portal
Publication:2420403
Recommendations
- On covering an independent set in a grid with a second independent set
- Independent domination of grids
- Independent [1,2]-domination of grids via min-plus algebra
- The Number of Independent Sets in a Grid Graph
- On the independence complex of square grids
- Maximal independent sets on a grid graph
- Proof without words: independent sets in grid graphs and tilings of Aztec diamonds
- 2 n grids have unbounded anagram-free chromatic number
- Constructing \(\gamma\)-sets of grids
- Maximal independent sets in grid graphs
Cites work
- Efficient location of resources in cylindrical networks
- Graphs \& digraphs
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1163636 (Why is no real title available?)
- scientific article; zbMATH DE number 975419 (Why is no real title available?)
- Independent \([1,k]\)-sets in graphs
- Independent domination of grids
- Perfect codes in graphs
Cited in
(3)
This page was built for publication: Every grid has an independent \([1, 2]\)-set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2420403)