Long paths with endpoints in given vertex-subsets of graphs
From MaRDI portal
Publication:941396
DOI10.1016/j.disc.2007.08.056zbMath1152.05039MaRDI QIDQ941396
Publication date: 4 September 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.056
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C45: Eulerian and Hamiltonian graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycles through specified vertices
- Hamilton connected graphs
- On a conjecture of Woodall
- Cycles through prescribed vertices with large degree sum
- The Erdös-Sós conjecture for graphs of girth 5
- Note on Hamilton Circuits
- On maximal paths and circuits of graphs
- 2‐neighborhoods and hamiltonian conditions
- Some Theorems on Abstract Graphs