The following pages link to Large cycles in graphs (Q2548258):
Displaying 50 items.
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles (Q308339) (← links)
- Hamiltonian cycles in critical graphs with large maximum degree (Q343761) (← links)
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
- Hamilton cycles in implicit claw-heavy graphs (Q402356) (← links)
- An implicit weighted degree condition for heavy cycles (Q472135) (← links)
- A sufficient condition involving implicit degree and neighborhood intersection for long cycles (Q477634) (← links)
- Implicit degree condition for Hamiltonicity of 2-heavy graphs (Q505434) (← links)
- Pancyclic properties of the graph of some 0-1 polyhedra (Q595680) (← links)
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II) (Q686466) (← links)
- Long cycles and the codiameter of a graph. I (Q749555) (← links)
- Stability results on the circumference of a graph (Q783243) (← links)
- Spectral extrema of graphs: forbidden hexagon (Q785828) (← links)
- New sufficient conditions for cycles in graphs (Q801082) (← links)
- Relations between parameters of a graph (Q802633) (← links)
- A short proof of a theorem about the circumference of a graph (Q916676) (← links)
- On degree sum conditions for long cycles and cycles through specified vertices (Q998401) (← links)
- An implicit degree condition for long cycles in 2-connected graphs (Q1031703) (← links)
- Existence of dominating cycles and paths (Q1173098) (← links)
- All Ramsey numbers for cycles in graphs (Q1212477) (← links)
- On maximal circuits in directed graphs (Q1213883) (← links)
- On path connected graphs (Q1226503) (← links)
- Sur les arborescences dans un graphe oriente (Q1229222) (← links)
- Cycles of length 0 modulo 4 in graphs (Q1309447) (← links)
- Packing pentagons into complete graphs: How clumsy can you get? (Q1322192) (← links)
- On cycle lengths in graphs of moderate degree (Q1322247) (← links)
- A sufficient condition guaranteeing large cycles in graphs (Q1357752) (← links)
- A sufficient condition for all short cycles (Q1372730) (← links)
- Graphs with large maximum degree containing no odd cycles of a given length (Q1405126) (← links)
- On completely positive graphs and their complements (Q1406281) (← links)
- An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian (Q1707969) (← links)
- A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness (Q1801685) (← links)
- Cycles of even length in graphs (Q1844243) (← links)
- On pancyclic digraphs (Q1844685) (← links)
- A short proof of Fan's theorem (Q1887652) (← links)
- An extremal problem for cycles in hamiltonian graphs (Q1900521) (← links)
- A note on dominating cycles in 2-connected graphs (Q1923475) (← links)
- A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs (Q2023732) (← links)
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals (Q2168562) (← links)
- A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture (Q2221920) (← links)
- Adjacency eigenvalues of graphs without short odd cycles (Q2237217) (← links)
- A spectral condition for odd cycles in non-bipartite graphs (Q2238862) (← links)
- Minimal paths and cycles in set systems (Q2372429) (← links)
- An implicit degree sum condition for cycles through specified vertices (Q2410579) (← links)
- Revisit of Erdős-Gallai's theorem on the circumference of a graph (Q2444861) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Ramsey numbers for cycles in graphs (Q2556422) (← links)
- Hamilton cycles in implicit 2-heavy graphs (Q2631075) (← links)
- Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph (Q2689114) (← links)
- Stability of Woodall's theorem and spectral conditions for large cycles (Q2692178) (← links)
- A new short proof of Fan Theorem (Q2831783) (← links)
