Pages that link to "Item:Q1182981"

The following pages link to Hamiltonian properties of graphs with large neighborhood unions (Q1182981):

Displaying 20 items.

• Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs (Q489317) (← links)
• Spanning trees: A survey (Q659663) (← links)
• Four sufficient conditions for hamiltonian graphs (Q803156) (← links)
• On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs (Q1196745) (← links)
• Long cycles, degree sums and neighborhood unions (Q1309446) (← links)
• A generalization of Ore's Theorem involving neighborhood unions (Q1313847) (← links)
• A proof of a conjecture about \(D_ \lambda\)-paths in graphs with large neighborhood unions (Q1356422) (← links)
• Claw-free graphs---a survey (Q1356695) (← links)
• Long dominating cycles in graphs (Q1377887) (← links)
• Graphs with large maximum degree containing no odd cycles of a given length (Q1405126) (← links)
• Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs (Q1633754) (← links)
• One sufficient condition for Hamiltonian graphs involving distances (Q1759263) (← links)
• A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs (Q1896341) (← links)
• Two new sufficient conditions for Hamilton-connected graphs (Q1898892) (← links)
• A note on dominating cycles in 2-connected graphs (Q1923475) (← links)
• Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle (Q2400580) (← links)
• Degree and neighborhood conditions for Hamiltonicity of claw-free graphs (Q2404404) (← links)
• Neighborhood unions and extremal spanning trees (Q2427493) (← links)
• Toughness in graphs -- a survey (Q2494126) (← links)
• Traceability in $\{K_{1,4},K_{1,4}+e\}$-free graphs (Q5227114) (← links)