The following pages link to (Q5722819):
Displaying 50 items.
- A degree sequence Hajnal-Szemerédi theorem (Q256981) (← 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)
- Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs (Q394360) (← links)
- A survey on Hamilton cycles in directed graphs (Q412269) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- Best monotone degree conditions for binding number and cycle structure (Q496429) (← links)
- Pósa-condition and nowhere-zero 3-flows (Q536209) (← links)
- The generating graph of some monolithic groups. (Q662032) (← links)
- On the generating graphs of symmetric groups (Q721699) (← links)
- Berge cycles in non-uniform hypergraphs (Q783055) (← links)
- Two theorems on Hamiltonian graphs (Q800937) (← links)
- New sufficient conditions for cycles in graphs (Q801082) (← links)
- Solution of two problems of P. Erdős concerning Hamiltonian cycles (Q810050) (← links)
- Degree conditions for Hamiltonicity: counting the number of missing edges (Q868355) (← links)
- Some localization theorems on Hamiltonian circuits (Q920111) (← links)
- On 2-factors with \(k\) components (Q952657) (← links)
- Hamiltonian degree sequences in digraphs (Q974465) (← links)
- Trees through specified vertices (Q1043624) (← links)
- Dirac's type sufficient conditions for hamiltonicity and pancyclicity (Q1043808) (← links)
- A note on the computation on the k-closure of a graph (Q1108040) (← links)
- Scattering number and extremal non-Hamiltonian graphs (Q1109047) (← links)
- Minimum graphs with complete k-closure (Q1146691) (← links)
- On maximal circuits in directed graphs (Q1213883) (← links)
- Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen (Q1218870) (← links)
- On path connected graphs (Q1226503) (← links)
- A method in graph theory (Q1227760) (← links)
- Pancyclic graphs and a conjecture of Bondy and Chvatal (Q1394236) (← links)
- Weakly pancyclic graphs (Q1569055) (← links)
- Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor (Q1684941) (← links)
- Chorded pancyclicity in \(k\)-partite graphs (Q1756119) (← links)
- Dense arbitrarily vertex decomposable graphs (Q1928285) (← links)
- On Hamiltonian cycles in hypergraphs with dense link graphs (Q2040014) (← links)
- Finding long cycles in balanced tripartite graphs: a first step (Q2073190) (← links)
- The structure of graphs with given lengths of cycles (Q2092440) (← links)
- A generalization of a theorem of Nash-Williams (Q2102754) (← links)
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals (Q2168562) (← links)
- The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths (Q2236805) (← links)
- Sufficient conditions for a graph to be Hamiltonian (Q2265440) (← links)
- Dense on-line arbitrarily partitionable graphs (Q2357776) (← links)
- Corrigendum. Three-color Ramsey numbers for paths (Q2377672) (← links)
- A stability version for a theorem of Erdős on nonhamiltonian graphs (Q2401804) (← links)
- Tough graphs and Hamiltonian circuits. (Reprint) (Q2497990) (← links)
- On Hamilton's ideals (Q2545100) (← links)
- On Hamilton circuits and Hamilton paths (Q2547564) (← links)
- On a theorem of Chartrand, Kapoor and Kronk (Q2548966) (← links)
- Note on Hamilton circuits and Hamilton paths (Q2555872) (← links)
- Tough graphs and Hamiltonian circuits. (Q2558871) (← links)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
- On Hamiltonian bipartite graphs (Q2626464) (← links)
