arXiv (All)
open access
A Finer View of the Parameterized Landscape of Labeled Graph Contractions
We study the \textsc{Labeled Contractibility} problem, where the input consists of two vertex-labeled graphs $G$ and $H$, and the goal is to determine whether $H$ can be obtained from $G$ via a sequence of edge contractions. Lafond and Marchand~[WADS 2025] initiated the parameterized complexity st
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
- Extremal problems for cancellative and locally thin hypergraphs#986484
- On two minimax theorems in graph#490182
- Polynomial-time recognition and maximum independent set in Burling graphs#174041
- Polynomial-time recognition and maximum independent set in Burling graphs#173463
- Polynomial-time recognition and maximum independent set in Burling graphs#173213
Record · ID 1049684
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