HAL (France)
open access
Maximum Independent Set when Excluding an Induced Minor: K_1 + tK_2 and tC_3 cup C_4
Dallard, Milanič, and Štorgel [JCTB '24] ask if, for every class excluding a fixed planar graph $H$ as an induced minor, \textsc{Maximum Independent Set} can be solved in polynomial time, and show that this is indeed the case when $H$ is any planar complete bipartite graph, or the 5-vertex clique mi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor#998825
- Coefficientwise Extremality and Rigidity for Independent Sets in Bipartite Graph Covers#1325788
- A note on efficient k-limited broadcast domination in graphs#659009
- A note on efficient k-limited broadcast domination in graphs#656873
- Spanning subhypergraphs with degree constraints#1109177
Record · ID 1312289
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive