Louisiana Tech Digital Commons
metadata only
A Complete Characterization of Near Outer-Planar Graphs
A graph is outer-planar (OP) if it has a plane embedding in which all of the vertices lie on the boundary of the outer face. A graph is near outer-planar (NOP) if it is edgeless or has an edge whose deletion results in an outer-planar graph. An edge of a non outer-planar graph whose removal results
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
- On Eigenvalue Bounds for Bounded Genus Graphs and Minor-Free Graphs#1105150
- Exact distance Kneser graphs#792592
- Exact distance Kneser graphs#788592
- The Distance Between the Adjacency Spectral Center and the Characteristic Set of a Tree#1123353
- Separator Theorem for Minor-Free Graphs in Linear Time#986177
Record · ID 938987
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