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.05083OpenAlexW2796712670MaRDI 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
Related Items (13)
On \(k\)-ordered graphs involved degree sum ⋮ New Ore-Type Conditions for H-Linked Graphs ⋮ Subdivision extendibility ⋮ 2-Trees: Structural insights and the study of Hamiltonian paths ⋮ On low degree \(k\)-ordered graphs ⋮ A study on thek-ordered hamiltonian graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem ⋮ Minimum degree conditions for \(H\)-linked graphs ⋮ Long cycles containing \(k\)-ordered vertices in 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
Cites Work
This page was built for publication: Onk-ordered graphs
