Pages that link to "Item:Q383779"

The following pages link to Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779):

Displaying 30 items.

• Hamilton cycles in implicit claw-heavy graphs (Q402356) (← links)
• Locating any two vertices on Hamiltonian cycles in large graphs (Q776260) (← links)
• 2-factors with \(k\) cycles in Hamiltonian graphs (Q777484) (← links)
• Ore-type degree conditions for disjoint path covers in simple graphs (Q898138) (← links)
• Distributing pairs of vertices on Hamiltonian cycles (Q1650670) (← links)
• Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path (Q1671309) (← links)
• On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles (Q1689917) (← links)
• A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs (Q2124605) (← links)
• On Hamiltonicity of regular graphs with bounded second neighborhoods (Q2143049) (← links)
• Hamiltonian paths, unit-interval complexes, and determinantal facet ideals (Q2168562) (← links)
• A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path (Q2181227) (← links)
• A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture (Q2221920) (← links)
• The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs (Q2274182) (← links)
• Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable (Q2282471) (← links)
• Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers (Q2303439) (← links)
• A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs (Q2404378) (← links)
• Hamilton-connected, vertex-pancyclic and bipartite holes (Q2675870) (← links)
• Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles (Q2689639) (← links)
• The robust component structure of dense regular graphs and applications (Q2940076) (← links)
• Some Hamiltonian Properties of One-Conflict Graphs (Q2946062) (← links)
• Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path (Q2971135) (← links)
• On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity (Q3120260) (← links)
• On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs (Q4602862) (← links)
• Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One (Q4632185) (← links)
• Spanning trees with a bounded number of leaves (Q4690981) (← links)
• COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH (Q5151276) (← links)
• A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity (Q5210982) (← links)
• Cycle partitions of regular graphs (Q5886097) (← links)
• The cycle spectrum of claw-free Hamiltonian graphs (Q5964977) (← links)
• A degree condition for cycles passing through specified vertices and edges (Q6056727) (← links)