The following pages link to (Q4448760):
Displaying 10 items.
- The degree-diameter problem for sparse graph classes (Q491538) (← links)
- Covering nearly surface-embedded graphs with a fixed number of balls (Q741614) (← links)
- Problems from CGCS Luminy, May 2007 (Q966173) (← links)
- New bounds for multi-label interval routing (Q1884964) (← links)
- VC-dimension and Erdős-Pósa property (Q2515568) (← links)
- Augmenting outerplanar graphs to meet diameter requirements (Q2862552) (← links)
- On covering bridged plane triangulations with balls (Q4434549) (← links)
- Power domination in planar graphs with small diameter (Q5436223) (← links)
- The degree/diameter problem in maximal planar bipartite graphs (Q5890615) (← links)
- The degree/diameter problem in maximal planar bipartite graphs (Q5965484) (← links)