On Saito's conjecture and the Oberly-Sumner conjectures
From MaRDI portal
Publication:2409500
DOI10.1007/s00373-017-1820-5zbMath1371.05152OpenAlexW2621537455WikidataQ123260169 ScholiaQ123260169MaRDI QIDQ2409500
Jean E. Dunbar, Johan P. de Wet, Marietjie Frick, Ortrud R. Oellermann, Susan A. van Aardt
Publication date: 11 October 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1820-5
Hamiltonian\(K_{1,k}\)-free graphfully cycle extendable graphlocally \(k\)-\(P_3\)-connected graphlocally \(k\)-connected graphOberly-Sumner conjecturesSaito's conjecture
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global cycle properties of locally isometric graphs
- Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs
- Hamiltonian properties of locally connected graphs with bounded vertex degree
- Extending cycles in graphs
- Some localization theorems on Hamiltonian circuits
- The edge Hamiltonian path problem is NP-complete
- A remark on two sufficient conditions for Hamilton cycles
- Mengerian theorems for paths of bounded length
- Hamiltonicity of locally Hamiltonian and locally traceable graphs
- Pancyclicity and NP-completeness in planar graphs
- Pancyclic graphs. I
- A note on Hamiltonian circuits
- Note on Hamilton Circuits
- A strengthening of Kikustapos;s theorem
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Locally connected graphs
- Chvátal–Erdős Theorem: Old Theorem with New Aspects
- The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal--Erdös Condition
- Locally Hamiltonian and planar graphs
This page was built for publication: On Saito's conjecture and the Oberly-Sumner conjectures
