Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles
The famous Four Color Theorem states that any planar graph can be properly colored using at most four colors. However, if we want to properly color the square of a planar graph (or alternatively, color the graph using distinct colors on vertices at distance up to two from each other), we will always...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
VCU Scholars Compass
2015
|
| Subjects: | |
| Online Access: | http://scholarscompass.vcu.edu/etd/3816 http://scholarscompass.vcu.edu/cgi/viewcontent.cgi?article=4820&context=etd |