Timeline for Graph addition chains
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 25, 2017 at 13:04 | comment | added | daniello | In particular any "tree like" decomposition of a graph can usually be translated into a way of writing the graph as a "sum" of "parts". So tree decompositions, split/modular decompositions, and the strucural decompositions for perfect/claw-free/etc. graphs can be thought of in this way. For different decompositions the correspondence is more or less strong. | |
| May 24, 2017 at 20:02 | history | answered | David Eppstein | CC BY-SA 3.0 |