arXiv (All)
open access
Resolving Pisanski's Conjecture
We prove Pisanski's conjecture on quadrilateral embeddings of regular bipartite graphs. For integers $m\geq d\geq4$ with $4\mid md$, we construct both a connected simple $d$-regular bipartite graph $G$ with $m$ vertices in each bipartition class and an orientable quadrangulation. This graph's genus
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
- Order and Gorenstein properties for lattice path matroid polytopes#820127
- An independent computer-assisted proof of the Chen-Raspaud conjecture for k=4#1217703
- A Nine-Element Minor Theorem for 3-Connected Nonbinary Matroids with a W4-Minor#1065631
- Perfect Rectangular Tilings with Two Colors#1061927
- Periodic efficient total girth colorings in cubic maps of girth 4 correspond to 3-permutation face colorings#1130180
Record · ID 1297437
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