Deutsche Nationalbibliothek
metadata only
Length-Constrained Network Design in Planar Digraphs / Chandra Chekuri, Rhea Jain
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
- Extended shapes for the combinatorial design of RNA sequences#622710
- Long Directed Cycles in Vertex-Transitive Digraphs#635896
- Long Directed Cycles in Vertex-Transitive Digraphs#633547
- A Chvátal--Erdős type condition for supereulerian digraphs with $α_{2}=4$#793324
- A Chvátal--Erdős type condition for supereulerian digraphs with $α_{2}=4$#789320
Record · ID 1188612
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