Pages that link to "Item:Q1096650"

The following pages link to A generalization of a result of Häggkvist and Nicoghossian (Q1096650):

Displaying 21 items.

• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
• Degree sum conditions for the circumference of 4-connected graphs (Q400404) (← links)
• Computation of the 0-dual closure for hamiltonian graphs (Q686512) (← links)
• Edge bounds in nonhamiltonian \(k\)-connected graphs (Q879332) (← links)
• Hamiltonicity of 4-connected graphs (Q966553) (← 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)
• A look at cycles containing specified elements of a graph (Q1045026) (← links)
• A degree sum condition with connectivity for relative length of longest paths and cycles (Q1045188) (← links)
• A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs (Q1306429) (← links)
• On the length of longest dominating cycles in graphs (Q1309474) (← links)
• A generalization of a result of Bauer and Schmeichel (Q1313355) (← links)
• Cycles through subsets with large degree sums (Q1363686) (← links)
• A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs (Q1896341) (← links)
• A localization method in Hamiltonian graph theory (Q1998767) (← links)
• Wheel and star-critical Ramsey numbers for quadrilateral (Q2345616) (← links)
• Degree sum and connectivity conditions for dominating cycles (Q2477385) (← links)
• Toughness in graphs -- a survey (Q2494126) (← links)
• Some local-global phenomena in locally finite graphs (Q2659174) (← links)
• A Remark on Hamiltonian Cycles (Q4024478) (← links)
• A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity (Q5210982) (← links)