Pages that link to "Item:Q659764"
From MaRDI portal
The following pages link to How many conjectures can you stand? A survey (Q659764):
Displaying 16 items.
- On 1-Hamilton-connected claw-free graphs (Q394533) (← links)
- On some intriguing problems in Hamiltonian graph theory---a survey (Q1613468) (← links)
- Equivalences between Hamiltonicity and flow conjectures, and the sublinear defect property (Q1613542) (← links)
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs (Q1633754) (← links)
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs (Q1744755) (← links)
- The Hamiltonian properties in \(K_{1,r}\)-free split graphs (Q2124619) (← links)
- A note on 3-connected hourglass-free claw-free Hamilton-connected graphs (Q2142648) (← links)
- Hamilton cycles in line graphs of 3-hypergraphs (Q2144607) (← links)
- Thomassen's conjecture for line graphs of 3-hypergraphs (Q2174582) (← links)
- The Nash-Williams conjecture and the dominating cycle conjecture (Q2309214) (← links)
- Equivalence of Jackson's and Thomassen's conjectures (Q2349510) (← links)
- Recent advances on the Hamiltonian problem: survey III (Q2441350) (← links)
- Forbidden pairs and the existence of a dominating cycle (Q2515588) (← links)
- Strongly even cycle decomposable 4-regular line graphs (Q2662802) (← links)
- A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs (Q5417830) (← links)
- On 2-factors with a specified number of components in line graphs (Q6621179) (← links)
