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.
CitationFiol, M.A. A Boolean algebra approach to the construction of snarks. Graph Theory, Combinatorics and Applications. Eds. Y. Alavi, G. Chartrand, O.R. Oellermann, A.J. Schwenk. New York: John Wiley & Sons, 1991, Vol.1, 493-524.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com