Coloração em grafos e aplicações
This work brings an approach to the basic notions of Graph Theory, presenting historical context, concepts, de nitions and examples in order to provide the reader with previous knowledge of the theory. The main objective is to perform a study of the graphs applied to the staining using the dual grap...
| Autor: | |
|---|---|
| Formato: | tesis de maestría |
| Estado: | Versión publicada |
| Fecha de publicación: | 2018 |
| País: | Brasil |
| Recursos: | Universidade Federal de Sergipe (UFS) |
| Repositorio: | Repositório Institucional da UFS |
| Idioma: | portugués |
| OAI Identifier: | oai:oai:ri.ufs.br:repo_01:riufs/9211 |
| Acesso em linha: | http://ri.ufs.br/jspui/handle/riufs/9211 |
| Access Level: | acceso abierto |
| Palavra-chave: | Matemática Teoria dos grafos Coloração Sudoku Grafos Quatro cores Graphs Coloring Four colors CIENCIAS EXATAS E DA TERRA::MATEMATICA |
| Resumo: | This work brings an approach to the basic notions of Graph Theory, presenting historical context, concepts, de nitions and examples in order to provide the reader with previous knowledge of the theory. The main objective is to perform a study of the graphs applied to the staining using the dual graph and the method of the greedy algorithm. To do so, we will present the demonstration attempt of the 4-Color Theorem that had been developed by Kempe and the proof of the 5-Color Theorem, made 11 years later by Heawood. Finally, we will seek the resolution of some situations problems that will be modeled through the coloring of vertices. |
|---|