Timeline for Can graphs of bounded treewidth be covered by two graphs of bounded pathwidth?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 24, 2016 at 10:51 | history | edited | Victor |
edited tags
|
|
| Oct 18, 2016 at 19:04 | history | edited | Victor | CC BY-SA 3.0 |
added 310 characters in body
|
| Oct 18, 2016 at 18:55 | comment | added | Victor | @TonyHuynh, thanks for the observation. I forgot to mention it in the question. I'll update the question accordingly. | |
| Oct 18, 2016 at 18:28 | comment | added | Tony Huynh | It's true for $k=1$, with $f(1)=1$. Every tree can be decomposed into two forests of stars, and a star has pathwidth $1$. | |
| Oct 18, 2016 at 14:43 | history | asked | Victor | CC BY-SA 3.0 |