On the independence number of graphs with maximum degree 3

DOI10.1016/j.tcs.2013.01.031zbMath1266.05111OpenAlexW2056575191MaRDI QIDQ1951559

Fenghui Zhang, Iyad A. Kanj

Publication date: 6 June 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.031

zbMATH Keywords

independence numbermaximum independent setkernelizationcombinatorial lower bounds

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: On the independence number of graphs with maximum degree 3