Pages that link to "Item:Q290522"
From MaRDI portal
The following pages link to Lower and upper bounds for long induced paths in 3-connected planar graphs (Q290522):
Displaying 13 items.
- Monotone drawings of graphs with few directions (Q506161) (← links)
- Long induced paths in graphs (Q518170) (← links)
- Invulnerability of planar two-tree networks (Q1733045) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- Long induced paths in minor-closed graph classes and beyond (Q2684889) (← links)
- Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs (Q2864303) (← links)
- Long induced paths in 3-connected planar graphs (Q4522464) (← links)
- Morphing triangle contact representations of triangulations (Q6050235) (← links)
- Schnyder Woods and long induced paths in 3-connected planar graphs (Q6547944) (← links)
- Structural parameters of Schnyder woods (Q6646404) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)