Sciweavers

Share
CORR
2010
Springer

From Pathwidth to Connected Pathwidth

8 years 8 months ago
From Pathwidth to Connected Pathwidth
It is proven that the connected pathwidth of any graph G is at most 2
Dariusz Dereniowski
Added 22 Mar 2011
Updated 22 Mar 2011
Type Journal
Year 2010
Where CORR
Authors Dariusz Dereniowski
Comments (0)
books