The following pages link to \(N\)-separators in planar graphs (Q661948):
Displaying 10 items.
- On the maximum order of graphs embedded in surfaces (Q273165) (← links)
- Edge separators for quasi-binary trees (Q299105) (← links)
- The degree-diameter problem for sparse graph classes (Q491538) (← links)
- Maximum size of a planar graph with given degree and even diameter (Q661947) (← links)
- Separating double rays in locally finite planar graphs (Q1901031) (← links)
- On the path separability of planar graphs (Q2851515) (← links)
- (Q4873809) (← links)
- Maximum size of a planar graph with given degree and diameter (Q5301000) (← links)
- The degree/diameter problem in maximal planar bipartite graphs (Q5890615) (← links)
- The degree/diameter problem in maximal planar bipartite graphs (Q5965484) (← links)