arXiv (All)
open access
Colorful Minors
We introduce the notion of colorful minors, which generalizes the classical concept of rooted minors in graphs. A $q$-colorful graph= is defined as a pair $(G, χ),$ where $G$ is a graph and $χ$ assigns to each vertex a (possibly empty) subset of at most $q$ colors. The colorful minor relation enhanc
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
- Paired Disjunctive Domination Number of Middle Graphs#1012030
- Induced Forest Minor Theorem for Graphs Without an Induced Star#997291
- Generalized Sterboul--Deming Configurations#1000095
- From semi-total to equitable total colorings#144268
- Spectral Extremal Graphs without a $K_k$-Factor#1035928
Record · ID 927142
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