Cargando…
Coloring mixed hypergraphs
The theory of graph coloring has existed for more than 150 years. Historically, graph coloring involved finding the minimum number of colors to be assigned to the vertices so that adjacent vertices would have different colors. From this modest beginning, the theory has become central in discrete mat...
| Autor principal: | |
|---|---|
| Lenguaje: | eng |
| Publicado: |
American Mathematical Society
2002
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/2264220 |