The following pages link to Deeply asymmetric planar graphs (Q2565687):
Displaying 5 items.
- An extension of Kotzig's theorem (Q339478) (← links)
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 (Q727044) (← links)
- A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
- Paley and the Paley Graphs (Q3296727) (← links)
- Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs (Q3439454) (← links)
