A Boolean algebra approach to the construction of snarks
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 all...
| Autor: | |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Fecha de publicación: | 1991 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/2111 |
| Acceso en línea: | https://hdl.handle.net/2117/2111 |
| Access Level: | acceso abierto |
| Palabra clave: | Graph theory Edge-coloring Snark Boolean algebra Grafs, Teoria de Classificació AMS::05 Combinatorics::05C Graph theory |
| Sumario: | 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. |
|---|