arXiv (All)
open access
Sufficient conditions for a digraph to contain: a pre-Hamiltonian cycle and cycles of lengths 3 and 4
Let $D$ be a digraph of order $p\geq5$ with minimum degree at least $p-1$ and with minimum semi-degree at least $p/2-1$. In his excellent and renowned paper, ``Long Cycles in Digraphs" (Proc. London Mathematical Society (3), 42 (1981), Thomassen fully characterized the following for $p=2n+1$: (i)
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
- On Perfect Divisibility of Bull-Free Graphs Without Long Paths#1034674
- A Romany of the Snows, vol. 5 Being a Continuation of the Personal Histories of "Pierre and His People" and the Last Existing Records of Pretty Pierre#33803
- Jg.31.2026,Nr.3#683755
- Entire $p$-harmonic functions with an isolated critical point and failure of $C^1$-regularity of the natural gradient#1077051
- The Regularity datum on time-varying graph domains and Dirichlet--Regularity duality#1013031
Record · ID 1049695
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