arXiv (OAI Expanded)
open access
The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings
A graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y . A 1-disk OX drawing of G is a 1-planar drawing such that all vertices of X lie on the boundary of O and all vertices of Y and all e
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
- Bipartite Turán Numbers of Trees and Star Forests#1118674
- Endpoint Covering of Axis-Parallel Segments:Bichromatic and Monochromatic One-Center#1077748
- Polynomial Lower Bounds for Distributed Graph Sketching with Tiny Error: Connectivity and Spanning Tree Construction#973425
- The Full P-vertex Problem and Perfect Matchings for Bipartite Graphs#987518
- Maximizing the number of cliques in $K_{r+1}$-free graphs with forbidden properties#1051689
Record · ID 1082959
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