arXiv (OAI Expanded)
open access
Structural Parameterizations of $k$-Planarity
The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the minimum integer $k$ such that it is $k$-planar. The problem o
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
- Kontrollansvarig enligt Plan- och Bygglagen#370573
- Kontrollansvarig enligt Plan- och Bygglagen#370572
- Orientations of $10$-Edge-Connected Planar Multigraphs and Applications#614965
- Orientations of $10$-Edge-Connected Planar Multigraphs and Applications#613998
- Circuit Decomposition for Triangulations of Surfaces#927486
Record · ID 1056339
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