Let us say that a graph is k-apex if it contains a set of at most k vertices whose removal yields a planar graph. We define the apex number of a graph G as the minimum k for which G is k-apex. It is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback