arXiv (All)
open access
The Complexity of Hamiltonian Cycles and Paths with Prescribed Walk Lengths
Fix a set $S$ of positive integers. An $S$-Hamiltonian cycle is a cyclic ordering of all vertices of a graph such that each consecutive pair is joined by a walk whose length belongs to $S$. We study the complexity of deciding whether an input graph admits such an ordering, together with the correspo
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
- Longest cycles intersect linearly in highly connected graphs#1034521
- Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth#1051978
- Unavoidable induced subgraphs forced by graphs with many vertices of prescribed properties#1122975
- Classifying Prime Character Degree Graphs With Eight Vertices#1048599
- Sharper Zarankiewicz and Diagonal Bipartite Ramsey Bounds#1117649
Record · ID 1343815
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