1-extendability of independent sets
From MaRDI portal
Publication:2169951
DOI10.1007/978-3-031-06678-8_13OpenAlexW4285174067MaRDI QIDQ2169951
Pierre Bergé, Carl Feghali, Rémi Watrigant, Anthony Busson
Publication date: 30 August 2022
Full work available at URL: https://arxiv.org/abs/2204.05809
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- Parameterized complexity of independent set in H-free graphs
- On n-extendable graphs
- Unit disk graphs
- Some simplified NP-complete graph problems
- Well-covered graphs and extendability
- Extending matchings in graphs: A survey
- The matching extension problem in general graphs is co-NP-complete
- Face covers and the genus problem for apex graphs
- Well-covered claw-free graphs
- Optimal Binary Space Partitions in the Plane
- Universality considerations in VLSI circuits
- Complexity results for well‐covered graphs
- Parameterized Complexity of Independent Set in H-Free Graphs.
- Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs
- Some covering concepts in graphs
- On the complexity of \(k\)-SAT