On maximum independent sets in \(P_{5}\)-free graphs
type: Item
instance of: scholarly article
title: On maximum independent sets in \(P_{5}\)-free graphs
zbMATH Open document ID: 1210.05164
author: Bert Randerath
author: Ingo Schiermeyer
published in: Discrete Applied Mathematics
publication date: 2010-10-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5798495
zbMATH Keywords: independent set
zbMATH Keywords: independence number
zbMATH Keywords: subexponential algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2010.01.007
OpenAlex ID: W2048280336
cites work: Complete description of forbidden subgraphs in the structural domination problem
cites work: Dominating cliques in \(P_ 5\)-free graphs
cites work: Measure and conquer
cites work: Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
cites work: A New Characterization of P 6-Free Graphs
cites work: Q4414647
DOI: 10.1016/J.DAM.2010.01.007
description: scientific article; zbMATH DE number 5798495