The following pages link to Petr Hliněný (Q175586):
Displaying 6 items.
- 20 years of Negami's planar cover conjecture (Q604985) (← links)
- Crossing number is hard for cubic graphs (Q2496198) (← links)
- Approximating the Crossing Number of Apex Graphs (Q3611879) (← links)
- A Simpler Self-reduction Algorithm for Matroid Path-Width (Q4569568) (← links)
- A note on possible extensions of Negami's conjecture (Q4718733) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
