New cases of the polynomial solvability of the independent set problem for graphs with forbidden paths
From MaRDI portal
Publication:4558286
Recommendations
Cites work
- scientific article; zbMATH DE number 468640 (Why is no real title available?)
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
- Independent set in \(P_5\)-free graphs in polynomial time
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- On the maximum independent set problem in subclasses of subcubic graphs
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs
- Some results on graphs without long induced paths
- Weighted independent sets in classes of \(P_6\)-free graphs
Cited in
(5)- scientific article; zbMATH DE number 6460018 (Why is no real title available?)
- Some results on graphs without long induced paths
- Independent sets in the graphs with bounded minors of the extended incidence matrix
- scientific article; zbMATH DE number 468640 (Why is no real title available?)
- scientific article; zbMATH DE number 7742928 (Why is no real title available?)
This page was built for publication: New cases of the polynomial solvability of the independent set problem for graphs with forbidden paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558286)