arXiv (All)
open access
The Class Edge-Reconstruction Number of a Maximal Planar Graph Is One or Two
An edge card of a graph is obtained by deleting one edge, and a class edge-reconstruction number asks for the fewest carefully selected cards that identify the graph when its class is known. We determine the sharp universal bound for maximal planar graphs. Two selected cards always suffice, and the
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
- The Class Edge-Reconstruction Number of a Maximal Planar Graph Is One or Two#920042
- The Three-Dimensional Erdős Box Problem Has Exponent $11/4$#1037064
- Sharper Zarankiewicz and Diagonal Bipartite Ramsey Bounds#1117649
- Replica Thresholds for Stripeless Erasure Coding Based on Symmetric Block Designs#1077078
- A $O^*((2 + ε)^k)$ Time Algorithm for Cograph Deletion Using Unavoidable Subgraphs in Large Prime Graphs#1115504
Record · ID 924273
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