On maximum independent sets in \(P_{5}\)-free graphs
From MaRDI portal
Publication:708334
DOI10.1016/j.dam.2010.01.007zbMath1210.05164MaRDI QIDQ708334
Bert Randerath, Ingo Schiermeyer
Publication date: 11 October 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.01.007
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Spectral properties of cographs andP5-free graphs, Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time, Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs, Independent domination in finitely defined classes of graphs: polynomial algorithms, A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs
Cites Work