That is, each edge receives two ``half colors'' so that no half color is repeated at a vertex ... anti-blocking pairs of polyhedra, Math. Programming 1 (1971) 168-194. [2] P.D. Seymour, On ...
A drawing of a graph G in the plane has the vertices represented by distinct points and the edges represented by polygonal lines joining their endpoints such that: no edge contains a vertex other than ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback