Maximum Independent Sets in Subcubic Graphs: New Results
Data Structures and Algorithms
2018-10-26 v1 Discrete Mathematics
Abstract
The maximum independent set problem is known to be NP-hard in the class of subcubic graphs, i.e. graphs of vertex degree at most 3. We present a polynomial-time solution in a subclass of subcubic graphs generalizing several previously known results.
Cite
@article{arxiv.1810.10940,
title = {Maximum Independent Sets in Subcubic Graphs: New Results},
author = {Ararat Harutyunyan and Michael Lampis and Vadim Lozin and Jérôme Monnot},
journal= {arXiv preprint arXiv:1810.10940},
year = {2018}
}