Asymptotically sharpening the $s$-Hamiltonian index bound
From MaRDI portal
Publication:6041429
DOI10.46298/dmtcs.8484zbMath1515.05108arXiv2109.05660OpenAlexW3199055508WikidataQ114020619 ScholiaQ114020619MaRDI QIDQ6041429
Hong-Jian Lai, Yehong Shao, Sulin Song, Lan Lei
Publication date: 30 May 2023
Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.05660
collapsible graphs\(k\)-triangular graph\(s\)-Hamiltonian\((s, t)\)-supereulerianline graph stable properties
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian index is NP-complete
- The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
- The \(s\)-Hamiltonian index
- On (s,t)-supereulerian graphs in locally highly connected graphs
- Hamilton-connected indices of graphs
- On the Hamiltonian index
- \(s\)-vertex pancyclic index
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- A reduction method to find spanning Eulerian subgraphs
- Supereulerian graphs: A survey
- The spanning subgraphs of eulerian graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On Hamiltonian Line-Graphs
- Hamilton cycles and closed trails in iterated line graphs
- Connectivity of iterated line graphs
- Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
