Abstract:
|
This work deals with the construction of snarks, that is, cubic graphs that cannot be 3-edge-colored. A natural generalization of the concept of "color", that describes in a simple way the coloring ("0" or "1") of any set of (semi)edges, is introduced. This approach allows us to apply the Boolean logic theory to find an ample family of snarks, which includes many of the previous known constructions and also some interesting ones. |