On the maximum independent set problem in graphs of bounded maximum degree
type: Item
instance of: scholarly article
title: On the maximum independent set problem in graphs of bounded maximum degree
zbMATH Open document ID: 1442.05164
author: D. Kharzeev
published in: Acta Mathematica Vietnamica
publication date: 2020-07-01T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 7216601
zbMATH Keywords: maximum independent set
zbMATH Keywords: stable set
zbMATH Keywords: low degree graph
MaRDI profile type: Publication
full work available at URL: s40306-020-00368-0
OpenAlex ID: W3036520051
cites work: Local transformations of graphs preserving independence number
cites work: A note on \(\alpha\)-redundant vertices in graphs
cites work: On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
cites work: Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs''
cites work: Lower bounds on the independence number in terms of the degrees
cites work: Reducibility among Combinatorial Problems
cites work: Q4404792
cites work: New sufficient conditions for \(\alpha\)-redundant vertices
cites work: The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs
cites work: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
cites work: Q2934676
cites work: On the Maximum Independent Set Problem in Subclasses of Planar Graphs
cites work: On the maximum independent set problem in subclasses of subcubic graphs
DOI: 10.1007/S40306-020-00368-0
description: scientific article; zbMATH DE number 7216601