Sciweavers

109
Voted
CORR
2010
Springer
126views Education» more  CORR 2010»
14 years 10 months ago
From Pathwidth to Connected Pathwidth
It is proven that the connected pathwidth of any graph G is at most 2
Dariusz Dereniowski