arXiv (All)
open access
$E$-restricted Double Traces
For a graph $G$ and $E \subseteq E(G)$, an $E$-restricted strong trace is a closed walk which traverses every edge from $E$ once in each direction and every other edge twice in the same direction, with no nontrivial repetition at any vertex. We characterize graphs admitting $E$-restricted strong tra
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 Ten-Vertex Counterexample to a Conjecture on Unstable Graphs#615256
- A Ten-Vertex Counterexample to a Conjecture on Unstable Graphs#614289
- Generalized Spectral Closedness and the Nonexistence of Walk-Realizable Supporters for Split Graphs#794069
- Generalized Spectral Closedness and the Nonexistence of Walk-Realizable Supporters for Split Graphs#790050
- Thinning and sprinkling: from robust sampling to almost Hamiltonicity#1078236
Record · ID 984771
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