arXiv (All)
open access
A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
Vertex deletion to the hereditary graph class has been well-studied in parameterized complexity. Vertex deletion in scattered graph classes has attracted attention in recent years. In this paper, we consider (PROPER-INTERVAL, TREE)-VERTEX DELETION, the input to which is an undirected graph $G = (V,
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
- The Erd\H os-Sós conjecture in dense graphs#985287
- The Full P-vertex Problem and Perfect Matchings for Bipartite Graphs#987518
- Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems#1233740
- Odd and Even Harder Problems on Cycle-Factors#1104900
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#924468
Record · ID 1326266
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