pith. sign in

arxiv: 1810.10940 · v1 · pith:RMLKTQLMnew · submitted 2018-10-25 · 💻 cs.DS · cs.DM

Maximum Independent Sets in Subcubic Graphs: New Results

Ararat Harutyunyan , Michael Lampis , Vadim Lozin , J\'er\^ome Monnot This is my paper
classification 💻 cs.DS cs.DM
keywords graphssubcubicindependentknownmaximumresultsclassdegree
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.