arXiv (OAI Expanded)
open access
The scramble number of outerplanar graphs
For planar graphs, it is known that their treewidth is bounded by $O(\sqrt{n})$, where $n$ is the number of vertices of the graph. A related invariant to treewidth, is the scramble number of graphs. Recently, Connor et. al proved that planar graphs of bounded maximal degree have scramble number boun
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 linear bound for nested cycles without geometric crossings#985258
- Optimally pseudorandom $K_4$-free graphs#1116792
- The Margolis-Rhodes Monoid of a Graph#1144337
- Nested Dissection for Sparse Null-Space Bases#770816
- Tree Engineering for Bit Index Explicit Replication (BIER-TE)#243917
Record · ID 1110329
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