Timeline for "Gluing and copy" graphs
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2022 at 23:16 | answer | added | user477519 | timeline score: 4 | |
| Jun 16, 2022 at 21:04 | history | became hot network question | |||
| Jun 16, 2022 at 15:42 | answer | added | aorq | timeline score: 11 | |
| Jun 16, 2022 at 13:59 | vote | accept | Fedor Petrov | ||
| Jun 16, 2022 at 13:52 | answer | added | Thomas Bloom | timeline score: 11 | |
| Jun 16, 2022 at 13:40 | comment | added | Fedor Petrov | @ThomasBloom would you please post this as an answer, to make the post answered? | |
| Jun 16, 2022 at 13:31 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
edited body
|
| Jun 16, 2022 at 13:29 | comment | added | Thomas Bloom | Ah yes, so it is! Neat. | |
| Jun 16, 2022 at 13:25 | comment | added | Fedor Petrov | @ThomasBloom Oh, it seems to be exactly the same class of graphs | |
| Jun 16, 2022 at 13:18 | comment | added | Thomas Bloom | Possibly interesting connection: by your alternative description, this class contains the distance-hereditary graphs (which can be characterised as those graphs such that every cycle with $\geq 5$ vertices has at least two 'crossing' chords). en.wikipedia.org/wiki/Distance-hereditary_graph | |
| Jun 16, 2022 at 13:00 | history | asked | Fedor Petrov | CC BY-SA 4.0 |