Abstract: An undirected graph is commonly represented as a set of vertices and a set of vertex doubletons; but one can also represent each vertex by a finite set so as to ensure that membership mimics ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results