arXiv (All)
open access
Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs
Motivated by Hadwiger's conjecture and related problems for list-coloring, we study graphs $H$ for which every graph with minimum degree at least $|V(H)|-1$ contains $H$ as a minor. We prove that a large class of apex-outerplanar graphs satisfies this property. Our result gives the first examples of
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 maximum number of edges in minimal matching covered graphs#1105537
- A disproof of a gap-one conjecture for the equitable chromatic number of block graphs#609675
- Total-coloring of planar graphs with maximum degree 6 and without prescribed 4-cycles#1014097
- Sub-quorum colorings of graphs#1051621
- A Near-Optimal Linear Range for the Erdős Matching Conjecture#985218
Record · ID 987368
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