Pages that link to "Item:Q1173631"
From MaRDI portal
The following pages link to The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices (Q1173631):
Displaying 7 items.
- Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs (Q686504) (← links)
- Bounds on path connectivity (Q761468) (← links)
- Edge-disjoint maximal planar graphs (Q1377726) (← links)
- Maximum graphs not spannable by \(r\) disjoint paths (Q1808830) (← links)
- The eavesdropping number of a graph (Q3070149) (← links)
- Edge maximal C_{2k+1}-edge disjoint free graphs (Q4647868) (← links)
- A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths (Q6663517) (← links)