Timeline for Two independent spanning trees of $2$-connected graph
Current License: CC BY-SA 4.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 11, 2021 at 7:43 | comment | added | Tony Huynh | It seems as if the case that $a$ is an internal vertex of the last ear and $b \in V(G') \setminus \{u\}$ needs more details (which I didn't write down). So, the proofs are probably the same length. | |
| Oct 11, 2021 at 7:05 | comment | added | okw1124 | I think our proofs have exactly the same essence. In fact, 'oriented path' in my proof is the result of your induction. But your one is much shorter, and looks nice! Thanks a lot. | |
| Oct 10, 2021 at 4:23 | vote | accept | okw1124 | ||
| Oct 8, 2021 at 14:49 | history | edited | Tony Huynh | CC BY-SA 4.0 |
edited body
|
| Oct 8, 2021 at 14:41 | history | undeleted | Tony Huynh | ||
| Oct 8, 2021 at 14:41 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 1729 characters in body
|
| Oct 8, 2021 at 5:34 | history | deleted | Tony Huynh | via Vote | |
| Oct 8, 2021 at 3:20 | comment | added | okw1124 | I think, maybe, I found a proper algorithm to draw such two trees. I will upload the sketch of my proof as soon as possible. | |
| Oct 8, 2021 at 2:47 | review | Low quality posts | |||
| Oct 8, 2021 at 5:43 | |||||
| Oct 8, 2021 at 2:47 | history | edited | Tony Huynh | CC BY-SA 4.0 |
deleted 1154 characters in body
|
| Oct 8, 2021 at 1:21 | comment | added | okw1124 | In addition, with my brief guess, if so, one of $T_1$ and $T_2$ must have a cycle. | |
| Oct 8, 2021 at 1:17 | comment | added | okw1124 | But if each of $ux_1$ path intersects with both of $ux_2$ paths, can we say $ux_i$ paths are internally-disjoint? | |
| Oct 8, 2021 at 1:14 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 118 characters in body
|
| Oct 8, 2021 at 1:08 | history | answered | Tony Huynh | CC BY-SA 4.0 |