The following pages link to Note on Hamilton Circuits (Q3264678):
Displayed 50 items.
- A \(k\)-tree containing specified vertices (Q604665) (← links)
- Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum (Q604675) (← links)
- Degree bounded spanning trees (Q605003) (← links)
- Computation of the 0-dual closure for hamiltonian graphs (Q686512) (← links)
- No-hole \((r+1)\)-distant colorings (Q688267) (← links)
- Extending cycles in graphs (Q750461) (← links)
- Two theorems on Hamiltonian graphs (Q800937) (← links)
- New sufficient conditions for cycles in graphs (Q801082) (← links)
- Four sufficient conditions for hamiltonian graphs (Q803156) (← links)
- An improved degree based condition for Hamiltonian cycles (Q845978) (← links)
- On a \(k\)-tree containing specified leaves in a graph (Q855299) (← links)
- Degree conditions for Hamiltonicity: counting the number of missing edges (Q868355) (← links)
- A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs (Q868356) (← links)
- Edge bounds in nonhamiltonian \(k\)-connected graphs (Q879332) (← links)
- Subdivision extendibility (Q879940) (← links)
- Algorithms for long paths in graphs (Q884457) (← links)
- \(k\)-factors and Hamilton cycles in graphs (Q884893) (← links)
- On a neighborhood condition implying the existence of disjoint complete graphs (Q911615) (← links)
- Some localization theorems on Hamiltonian circuits (Q920111) (← links)
- The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\) (Q925037) (← links)
- A 2-factor with short cycles passing through specified independent vertices in graph (Q937249) (← links)
- Long paths with endpoints in given vertex-subsets of graphs (Q941396) (← links)
- Ore-condition and \(Z_3\)-connectivity (Q942129) (← links)
- Hamiltonian-connected graphs (Q945175) (← links)
- The \(k\)-dominating cycles in graphs (Q966170) (← links)
- Degree with neighborhood conditions and highly Hamiltonian graphs (Q966486) (← links)
- Hamiltonicity of 4-connected graphs (Q966553) (← links)
- Algorithm for two disjoint long paths in 2-connected graphs (Q986559) (← links)
- Conditional fault hamiltonian connectivity of the complete graph (Q987830) (← links)
- On degree sum conditions for long cycles and cycles through specified vertices (Q998401) (← links)
- Ore-type versions of Brooks' theorem (Q1003831) (← links)
- A new sufficient condition for Hamiltonian graphs (Q1005735) (← links)
- Removable matchings and Hamiltonian cycles (Q1011771) (← links)
- Pancyclic graphs and linear forests (Q1011789) (← links)
- A degree sum condition concerning the connectivity and the independence number of a graph (Q1014827) (← links)
- Hamiltonian cycles and dominating cycles passing through a linear forest (Q1024474) (← links)
- Hamilton cycles in claw-heavy graphs (Q1025455) (← links)
- Degree condition for the existence of a \(k\)-factor containing a given Hamiltonian cycle (Q1025493) (← links)
- Degree conditions for the partition of a graph into cycles, edges and isolated vertices (Q1025545) (← links)
- Degree conditions and degree bounded trees (Q1025562) (← links)
- A degree condition implying that every matching is contained in a Hamiltonian cycle (Q1025570) (← links)
- On the spanning fan-connectivity of graphs (Q1028100) (← links)
- A comprehensive analysis of degree based condition for Hamiltonian cycles (Q1041248) (← links)
- On Hamiltonian cycles and Hamiltonian paths (Q1041720) (← links)
- Disjoint Hamiltonian cycles in bipartite graphs (Q1043548) (← links)
- Trees through specified vertices (Q1043624) (← links)
- Dirac's type sufficient conditions for hamiltonicity and pancyclicity (Q1043808) (← links)
- A degree sum condition for graphs to be prism Hamiltonian (Q1043943) (← links)
- Ore-type and Dirac-type theorems for matroids (Q1044205) (← links)
- Signless Laplacian spectral radius and Hamiltonicity (Q1044549) (← links)