Onk-ordered graphs
From MaRDI portal
Publication:4518332
DOI<69::AID-JGT1>3.0.CO;2-I 10.1002/1097-0118(200010)35:2<69::AID-JGT1>3.0.CO;2-IzbMath0958.05083MaRDI QIDQ4518332
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda Lesniak, Jill R. Faudree
Publication date: 30 March 2001
Full work available at URL: https://doi.org/10.1002/1097-0118(200010)35:2<69::aid-jgt1>3.0.co;2-i
05C45: Eulerian and Hamiltonian graphs
Related Items
2-Trees: Structural insights and the study of Hamiltonian paths, On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem, Subdivision extendibility, Minimum degree conditions for \(H\)-linked graphs, Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian, \(k\)-ordered hamiltonicity of iterated line graphs, A look at cycles containing specified elements of a graph, On \(k\)-ordered graphs involved degree sum, On low degree \(k\)-ordered graphs, Recent advances on the Hamiltonian problem: survey III, Long cycles containing \(k\)-ordered vertices in graphs, New Ore-Type Conditions for H-Linked Graphs, A study on thek-ordered hamiltonian graphs
Cites Work