Learn how to solve problems using linear programming. A linear programming problem involves finding the maximum or minimum value of an equation, called the objective functions, subject to a system of ...
If true, the following conjecture of Thomassen [Th81] is a planarity criterion for a special class of graphs that involves only K 5. Recall that a planar graph on n vertices contains at most 3n-6 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results