If a graph G is 5-connected and non-planar, then G has a TK5. The devil called 'TK5' You could call a TK5 the devil in the details. TK5s are larger relatives of K5, a very simple formation that looks ...
Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback