arXiv (All)
open access
On the Realizability of Edge-Girth Sequences
The edge-girth of an edge $e$ in a simple connected graph is the length of a shortest cycle containing $e$, with $g_e = \infty$ if no such cycle exists, and the edge-girth sequence of a graph is the nondecreasing sequence of the edge-girths of its edges. We characterize the sequences that are realiz
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 Tight Cycle-Cover Inequality for Shortest Common Superstring#1064465
- Replication-transcription collisions impose DNA strand-specific constraints on gene length in bacteria#483568
- A counterexample to Nagamochi's scoring lemma and a new rectangle packing bound#1141732
- Bewertung von Rissen in der Plattierung : Abschlussbericht ; Reaktorsicheitsforschung Vorhaben Nr. 1501278#1137065
- Skew cyclic codes through Drinfeld modules#1117618
Record · ID 1142754
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