Timeline for Minimum Spanning k-tree
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 28 at 13:13 | comment | added | Neal Young | It may help readers that the wikipedia link states "The k-trees are exactly the maximal graphs with a treewidth of k ("maximal" means that no more edges can be added without increasing their treewidth). They are also exactly the chordal graphs all of whose maximal cliques are the same size k + 1 and all of whose minimal clique separators are also all the same size k." | |
| S Oct 27 at 19:17 | review | First questions | |||
| Nov 5 at 11:55 | |||||
| S Oct 27 at 19:17 | history | asked | Quizzical | CC BY-SA 4.0 |