arXiv (All)
open access
Generalized Duke's theorem for signed Graphs
Duke's interpolation theorem states that the orientable genera of a connected graph form an integer interval, and Stahl established the corresponding result for nonorientable embeddings. In 1991, Širáň showed that this interpolation property fails for signed graph embeddings: the Euler-genus spectru
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
- A Resolution of the de Bruijn--Erdős Consecutive-Gap Problem#987883
- Small graphs without power-of-two cycles: a lower bound of 24, a correction to a construction of Exoo, and explicit bounds for f(k)#927953
- On prime coprime graphs of certain finite groups#1116117
- The Erdős-Gallai bound for consecutive even cycle lengths#974579
- A proof of the resistance diameter conjecture for line graphs#1109187
Record · ID 1064172
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