Degree conditions for k‐ordered hamiltonian graphs

Cited In (28)

Ramsey-Turán type results for matchings in edge colored graphs
Ramsey number of paths and connected matchings in Ore-type host graphs
Minimum degree condition for a graph to be knitted
Title not available (Why is that?)
Recent advances on the Hamiltonian problem: survey III
Set-orderedness as a generalization of \(k\)-orderedness and cyclability
\(k\)-Ordered Hamilton cycles in digraphs
A degree condition for Hamiltonian digraphs
A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity
On low degree \(k\)-ordered graphs
Title not available (Why is that?)
A study on thek-ordered hamiltonian graphs
A look at cycles containing specified elements of a graph
4-connected triangulations and 4-orderedness
On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture
A survey on Hamilton cycles in directed graphs
A fan-type result on \(k\)-ordered graphs
Long cycles containing \(k\)-ordered vertices in graphs
Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles
2-spanning cyclability problems of some generalized Petersen graphs
Degree sum condition for \(k\)-ordered Hamiltonian connected graphs
Hamiltonian Extension
The number of Hamiltonian decompositions of regular graphs
Generalizing vertex pancyclic and \(k\)-ordered graphs
Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian
Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
2-Trees: Structural insights and the study of Hamiltonian paths

Recommendations

This page was built for publication: Degree conditions for k‐ordered hamiltonian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4800399)