Pages that link to "Item:Q313786"
From MaRDI portal
The following pages link to On the path separation number of graphs (Q313786):
Displaying 13 items.
- Separating path systems (Q482277) (← links)
- The vertex separation number of a graph equals its path-width (Q1198094) (← links)
- Metric decompositions of path-separable graphs (Q1679219) (← links)
- The separator theorem for rooted directed vertex graphs (Q1850517) (← links)
- Pagenumber of pathwidth-\(k\) graphs and strong pathwidth-\(k\) graphs (Q1861235) (← links)
- On computing the path number of a graph (Q2132346) (← links)
- On the number of edges of separated multigraphs (Q2151445) (← links)
- Path Separability of Graphs (Q3587357) (← links)
- On the separation number of a graph (Q3833885) (← links)
- (Q4664110) (← links)
- (Q4794016) (← links)
- Separating path systems for the complete graph (Q6136668) (← links)
- Separating path systems of almost linear size (Q6571612) (← links)