arXiv (All)
open access
The Erdős-Pósa Property for Colorful Minors
A colorful graph relation enhances the minor relation by merging color sets along contractions and by allowing the removal of colors; it generalizes rooted minors and models problems on graphs with several, possibly overlapping, annotated vertex sets. A graph has the Erdős-Pósa property for minors i
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
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#924468
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#920237
- Faster Minimum k-Cut II: Near-Optimal and Deterministic for Weighted Graphs#1064341
- Fundamentals of domination in graphs#1179875
- Chromatic symmetric functions for annular webs#1037391
Record · ID 971921
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