Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order
From MaRDI portal
Publication:6101478
DOI10.1080/09728600.2022.2145922zbMath1511.05166MaRDI QIDQ6101478
No author found.
Publication date: 1 June 2023
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- A note on Turán numbers for even wheels
- Maximal cycles in graphs
- Edge maximal non-bipartite graphs without odd cycles of prescribed lengths
- Turán numbers for odd wheels
- An extremal problem for cycles in hamiltonian graphs
- Edge-maximal graphs without \(\theta_{2k+1}\)-graphs
- Pancyclic graphs. I
- Large cycles in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item