arXiv (All)
open access
Paths with Prescribed Endpoints in Semicomplete and Locally Semicomplete Digraphs
We study two open path problems with prescribed endpoints posed by Bang-Jensen and Gutin. The first asks for a longest $(x,y)$-path in a semicomplete digraph. The second asks whether a locally semicomplete digraph has a Hamiltonian $(x,y)$-path. For semicomplete digraphs, we solve the first problem
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
- Poems of the Heart and Home#34102
- Choquet-type extensions of set-pair functions, and applications in graph limits, hypergraphs, and metric measure spaces#1156444
- Advertisement of Multiple Paths in BGP#166265
- Total Variation Regularization for Manifold-Valued Data#260064
- Boundary regularity for nonlocal operators with kernels of variable orders#677278
Record · ID 927425
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