The following pages link to On Hamilton's ideals (Q2545100):
Displaying 50 items.
- Spectral condition for Hamiltonicity of a graph (Q252603) (← links)
- A degree sequence Hajnal-Szemerédi theorem (Q256981) (← links)
- Some sufficient conditions for Hamiltonian property in terms of Wiener-type invariants (Q263846) (← links)
- On a degree sequence analogue of Pósa's conjecture (Q322234) (← links)
- Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
- Vertex arboricity and vertex degrees (Q343708) (← links)
- Hamiltonian cycles in critical graphs with large maximum degree (Q343761) (← links)
- Monochromatic cycle partitions of graphs with large minimum degree (Q345114) (← links)
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
- A sufficient condition for the existence of an anti-directed 2-factor in a directed graph (Q409370) (← links)
- A survey on Hamilton cycles in directed graphs (Q412269) (← links)
- Cycle spectra of Hamiltonian graphs (Q444376) (← links)
- Spectral radius and Hamiltonian graphs (Q445828) (← links)
- Sufficient spectral conditions on Hamiltonian and traceable graphs (Q477765) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- Best monotone degree conditions for binding number and cycle structure (Q496429) (← links)
- Spectral conditions for some graphical properties (Q526290) (← links)
- Best monotone degree conditions for binding number (Q641165) (← links)
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) (Q668072) (← links)
- Applying a condition for a Hamiltonian bipartite graph to be bipancyclic (Q686432) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- On existence theorems (Q686508) (← links)
- Computation of the 0-dual closure for hamiltonian graphs (Q686512) (← links)
- On the generating graphs of symmetric groups (Q721699) (← links)
- Stability results on the circumference of a graph (Q783243) (← links)
- Two theorems on Hamiltonian graphs (Q800937) (← links)
- New sufficient conditions for cycles in graphs (Q801082) (← links)
- Cycle lengths of Hamiltonian \(P_\ell\)-free graphs (Q897235) (← links)
- The chromatic index of multigraphs that are nearly full (Q910411) (← links)
- Hamiltonian degree conditions which imply a graph is pancyclic (Q912127) (← links)
- Hamiltonian degree sequences in digraphs (Q974465) (← links)
- The hamiltonian index of a 2-connected graph (Q998378) (← links)
- Mutually orthogonal Hamiltonian connected graphs (Q1033035) (← links)
- Hamilton cycles and paths in vertex-transitive graphs-current directions (Q1044917) (← links)
- Coprime ordering of cyclic planar difference sets (Q1045006) (← links)
- Subgraphs intersecting any Hamiltonian cycle (Q1077429) (← links)
- Hamiltonian threshold graphs (Q1080870) (← links)
- A cycle structure theorem for Hamiltonian graphs (Q1085183) (← links)
- The edge-chromatic class of regular graphs of degree 4 and their complements (Q1087882) (← links)
- A note on the computation on the k-closure of a graph (Q1108040) (← links)
- Scattering number and extremal non-Hamiltonian graphs (Q1109047) (← links)
- Random interval graphs (Q1112069) (← links)
- Minimum graphs with complete k-closure (Q1146691) (← links)
- Hamiltonicity and combinatorial polyhedra (Q1147161) (← links)
- Covering the vertices of a digraph by cycles of prescribed length (Q1174160) (← links)
- Stable properties of graphs (Q1175986) (← links)
- On Ore-type sufficient condition for a bipancyclic ordering (Q1193427) (← links)
- A condition for a Hamiltonian bipartite graph to be bipancyclic (Q1193443) (← links)
- The chromatic index of a graph whose core has maximum degree two (Q1197023) (← links)
- On n-Hamiltonian graphs (Q1221119) (← links)
