Premium
Maximal independent sets in grid graphs
Author(s) -
Ortiz Carmen,
Villanueva Mónica
Publication year - 2016
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12291
Subject(s) - combinatorics , split graph , block graph , intersection graph , pathwidth , mathematics , maximal independent set , lattice graph , chordal graph , discrete mathematics , cartesian product , indifference graph , longest path problem , grid , cograph , graph , line graph , voltage graph , geometry
Abstract A grid graph is the Cartesian product of two path graphs. Enumerating all maximal independent sets in a graph is a well‐known combinatorial problem. For a general graph, it is # P − c o m p l e t e . In this work, we provide a polynomial‐time algorithm to generate the whole family of maximal independent sets (mis) of complete grid graphs with two rows. The same algorithm is used in two particular cases: chordless paths and cycles. We apply this result to characterize the independent graph (intersection graph of maximal independent sets) of these three classes of graphs. We also present an alternative proof of Euler's result for grid graphs with three rows that can be used for enumerating the family of mis.