The following pages link to Bounds on path connectivity (Q761468):
Displaying 5 items.
- Tight bounds for connecting sites across barriers (Q958235) (← links)
- The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices (Q1173631) (← links)
- The \(k\)-subconnectedness of planar graphs (Q2133309) (← links)
- On the maximum degree of path-pairable planar graphs (Q2415080) (← links)
- (Q4529522) (← links)