arXiv (All)
open access
Graph Puzzles III.1: A Proof of Sabidussi's Compatibility Conjecture
We prove Sabidussi's compatibility conjecture. Let $G$ be a finite connected multigraph in which every vertex has even degree and the minimum degree is at least four, and let $T$ be an Euler tour of $G$. The edges of $G$ can be partitioned into circuits (connected $2$-regular subgraphs) so that no c
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
- Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs#987368
- Local Clique Covers and Chromatic Number#985390
- A disproof of a gap-one conjecture for the equitable chromatic number of block graphs#609675
- Disproof of the dominating Hadwiger conjecture#1129953
- A Proof of the Tratnik-Ye Medianity Conjecture of Resonance Graphs on Surfaces#1070497
Record · ID 1215429
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