Pages that link to "Item:Q2891038"
From MaRDI portal
The following pages link to Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs (Q2891038):
Displaying 11 items.
- How many conjectures can you stand? A survey (Q659764) (← links)
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- Every 4-connected line graph of a planar graph is Hamiltonian (Q1340124) (← links)
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360) (← links)
- A note on the shortness coefficient and the Hamiltonicity of 4-connected line graphs (Q1777242) (← links)
- Thomassen's conjecture for line graphs of 3-hypergraphs (Q2174582) (← links)
- Equivalence of Jackson's and Thomassen's conjectures (Q2349510) (← links)
- 2-edge-Hamiltonian-connectedness of 4-connected plane graphs (Q2509769) (← links)
- On \(s\)-Hamiltonian line graphs (Q2862549) (← links)
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
- A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs (Q5417830) (← links)