The following pages link to Induced circuits in planar graphs (Q1322013):
Displaying 9 items.
- A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- An algorithm for min-cost edge-disjoint cycles and its applications (Q1200787) (← links)
- The complexity of induced minors and related problems (Q1346772) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Induced circuits in graphs on surfaces (Q4273845) (← links)
- Non-interfering network flows (Q5056145) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)