Pages that link to "Item:Q653839"
From MaRDI portal
The following pages link to Algorithms for finding an induced cycle in planar graphs (Q653839):
Displaying 8 items.
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Detecting cycles through three fixed vertices in a graph (Q1198018) (← links)
- Induced circuits in planar graphs (Q1322013) (← links)
- Finding and listing induced paths and cycles (Q1941391) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Induced circuits in graphs on surfaces (Q4273845) (← links)
- (Q5743476) (← links)
- A more accurate view of the flat wall theorem (Q6606321) (← links)