To access the full text documents, please follow this link: http://hdl.handle.net/2117/2111

A Boolean algebra approach to the construction of snarks
Fiol Mora, Miquel Àngel
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
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.
2012-05-10
Graph theory
Edge-coloring
Snark
Boolean algebra
Grafs, Teoria de
Classificació AMS::05 Combinatorics::05C Graph theory
Consulteu les condicions d'ús d'aquest document en el repositori original:http://hdl.handle.net/2117/2111
Book Part
John Wiley & Sons
         

Show full item record

 

Coordination

 

Supporters