Pages that link to "Item:Q3149885"
From MaRDI portal
The following pages link to Approximating the Longest Cycle Problem in Sparse Graphs (Q3149885):
Displaying 15 items.
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Approximating the longest paths in grid graphs (Q719276) (← links)
- Cycle lengths in sparse graphs (Q949802) (← links)
- Finding large cycles in Hamiltonian graphs (Q972323) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- On a simple randomized algorithm for finding a 2-factor in sparse graphs (Q1041775) (← links)
- Listing all fixed-length simple cycles in sparse graphs in optimal time (Q1679990) (← links)
- The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
- Theory and application of reciprocal transformation of “path problem” and “time float problem” (Q2969956) (← links)
- Understanding chicken walks on <i>n</i> × <i>n</i> grid: Hamiltonian paths, discrete dynamics, and rectifiable paths (Q3467125) (← links)
- On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs (Q4240135) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- A Lower Bound on Cycle-Finding in Sparse Digraphs (Q6058259) (← links)
- Approximating long cycle above Dirac's guarantee (Q6586667) (← links)
