Endpoint extendable paths in dense graphs
From MaRDI portal
Publication:442374
DOI10.1016/j.disc.2011.09.014zbMath1246.05085OpenAlexW1967676881MaRDI QIDQ442374
Guantao Chen, Hao Li, Zhi-quan Hu
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.014
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending cycles in graphs
- Forbidden subgraphs that imply 2-factors
- Tough graphs and Hamiltonian circuits.
- Note on Hamilton Circuits
- Non‐path spectrum sets
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Graphs in which every path is contained in a Hamilton path.
- Some Theorems on Abstract Graphs