arXiv (All)
open access
A Chvátal--Erdős type condition for supereulerian digraphs with $α_{2}=4$
A digraph is \textbf{supereulerian} if it contains a spanning closed trail. Let $α_2(D)$ denote the maximum cardinality of a vertex set inducing no 2-cycle. In this paper, we characterize supereulerianity in a strong digraph $D$ with $α_2(D)=4$ by proving that a strong digraph $D$ with $α_2(D)=4$ an
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
- A Chvátal--Erdős type condition for supereulerian digraphs with $α_{2}=4$#789320
- A quadratic refinement of Jackson's \CE\ condition for Hamilton cycles in digraphs#1048687
- Feedback edge set in bipartite digraph#974038
- Hamiltonian paths in the permutation digraphs $P(n,n-2)$#615262
- Hamiltonian paths in the permutation digraphs $P(n,n-2)$#614295
Record · ID 793324
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