arXiv (All)
open access
The matching extendability of optimal 2-planar graphs
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 matching extendability of optimal 2-planar graphs#619122
- The Full P-vertex Problem and Perfect Matchings for Bipartite Graphs#987518
- Compact Partial Symmetry Breaking for Graph Search Problems#1035952
- An improved bound on the treewidth of planar graphs excluding a grid minor#1109584
- Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means#1048544
Record · ID 620801
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