arXiv (OAI Expanded)
open access
Disproving the Petersen Coloring Conjecture: Theoretical Analysis and an Infinite Family of Counterexamples
In 1988, Jaeger conjectured that every bridgeless cubic graph $G$ admits a Petersen coloring; that is, a map $E(G) \to E(P)$ mapping any two adjacent edges of $G$ to two adjacent edges of the Petersen graph $P$. A positive resolution to Jaeger's conjecture would have immediately resolved several oth
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
- Perfect matching covers of claw-free cubic graphs#1156072
- Contribution à l'étude de quelques problèmes de coloration de graphes#370924
- A tris of perfect matchings in bridgeless claw-free cubic graphs#1064662
- Hamiltonian graphs with prescribed minimum degree and no near-spanning cycles#972532
- Sub-quorum colorings of some infinite families of caterpillars#1144586
Record · ID 1069877
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