Timeline for Spanning trees of $k$-edge-connected graphs
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 12, 2011 at 9:14 | history | edited | Gjergji Zaimi | CC BY-SA 3.0 |
added 1475 characters in body
|
| Aug 3, 2011 at 11:17 | comment | added | David Harris | I am interested in $f(n,m,k)$, where $m$ is small. Could you please explain more about how to use the methods of Bogdanowicz to determine this? In particular, can you always transform a $k$-connected graph $G$ into a $k$-connected threshold graph $G'$ by using these trasnsformations? It wasn't clear to me that the transformations preserve $k$-edge-connectivity for $k > 1$. Thanks! | |
| Aug 2, 2011 at 23:22 | history | edited | Gjergji Zaimi | CC BY-SA 3.0 |
added 204 characters in body
|
| Aug 2, 2011 at 20:20 | history | answered | Gjergji Zaimi | CC BY-SA 3.0 |