Counting Maximal Distance-Independent Sets in Grid Graphs

Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any ℓ ∈ N, maximal distance-ℓ independent (or simply: maximal ℓ-independent) sets are counted for some grids. The transfer...

Full description

Bibliographic Details
Main Authors: Euler Reinhardt, Oleksik Paweł, Skupień Zdzisław
Format: Article
Language:English
Published: University of Zielona Góra 2013-07-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.1707