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 11 items.
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Counting closed trails (Q1941684) (← links)
- Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
- The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
- Finding a smallest odd hole in a claw-free graph using global structure (Q2444540) (← links)
- Theory and application of reciprocal transformation of “path problem” and “time float problem” (Q2969956) (← links)
- Algorithmen zum Auffinden längster Kreise in Graphen. (Algorithms for finding longest cycles in graphs) (Q3995378) (← links)
- (Q4693654) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs (Q5851092) (← links)
- Exact methods for the longest induced cycle problem (Q6617731) (← links)