Pages that link to "Item:Q1939671"
From MaRDI portal
The following pages link to Exact algorithms for finding longest cycles in claw-free graphs (Q1939671):
Displaying 4 items.
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
- The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
- Theory and application of reciprocal transformation of “path problem” and “time float problem” (Q2969956) (← links)
