Pages that link to "Item:Q3446811"
From MaRDI portal
The following pages link to Approximating Longest Cycles in Graphs with Bounded Degrees (Q3446811):
Displaying 9 items.
- An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
- Strong conflict-free coloring for intervals (Q487034) (← links)
- Approximating the longest paths in grid graphs (Q719276) (← links)
- Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
- Finding large cycles in Hamiltonian graphs (Q972323) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- An approximation algorithm for the longest path problem in solid grid graphs (Q2815541) (← links)
- Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)
- Approximating long cycle above Dirac's guarantee (Q6586667) (← links)
