arXiv (All)
open access
The Plane-Saturation Ratio of Planar Graphs
For a planar graph \(G\), a plane subgraph \(H\) is plane-saturated with respect to \(G\) if adding any edge to the fixed drawing of \(H\), possibly together with new vertices, either creates a crossing or results in a graph that is not a subgraph of \(G\). The plane-saturation ratio \(\psr(G)\) is
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
- Maximum index of unbalanced signed graphs without a positive odd cycle#1326633
- Sub-polynomial parameterized complexity of $k$-core#1051912
- Nonregular graphs of odd maximum degree with maximum spectral radius#1076362
- Levelable graphs#662357
- Levelable graphs#661307
Record · ID 1457561
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