Forbidden subgraphs and 3-colorability
Classical vertex coloring problems ask for the minimum number of colors needed to color the vertices of a graph, such that adjacent vertices use different colors. Vertex coloring does have quite a few practical applications in communication theory, industry engineering and computer science. Such exa...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
Georgia Institute of Technology
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/48986 |