1 |
Wikipedia, "Graph Coloring," http://en.wikipedia.org/wiki/Graph_Coloring,Wikimedia Foundation Inc., 2013.
|
2 |
Wikipedia, "Edge Coloring," http://en.wikipedia.org/wiki/Edge_coloring,Wikimedia Foundation Inc., 2013.
|
3 |
Wikipedia, "Total Coloring," http://en.wikipedia.org/wiki/Total_coloring,Wikimedia Foundation Inc., 2013.
|
4 |
Wikipedia, "Degree (Graph Theory)," http://en.wikipedia.org/wiki/Degree_(graph-theory), Wikimedia Foundation Inc., 2013.
|
5 |
E. Weisstein, "Class 1 Graph," http://mathworld.wolfram.com/Class 1 graph, Wolfram Research Inc., 2013.
|
6 |
E. Weisstein, "Class 2 Graph," http://mathworld.wolfram.com/Class 2 graph, Wolfram Research Inc., 2013.
|
7 |
V. G. Vizing, "Critical Graphs with Given Chromatic Class," Metody Diskret. Analiz., Vol. 5, pp. 9-17, 1965.
|
8 |
D. P. Sanders and Y. Zhao, "Planar Graphs of Maximum Degree Seven are Class I," Journal of Combinatorial Theory Series B, Vol. 83, No. 2, pp. 201-212, 2001.
DOI
ScienceOn
|
9 |
S. U. Lee and M. B. Choi, "A Polynomial (P) Algorithm for Vertex Coloring (Chromatic Number) Problem," Journal of the Korea Society of Computer and Information, Vol. 16, No. 7, pp. 85-93, Jun, 2011.
과학기술학회마을
DOI
ScienceOn
|
10 |
S. U. Lee, "The Four Color Algorithm," Journal of the Korea Society of Computer and Information, Vol. 18, No. 5, pp. 113-120, May, 2013.
과학기술학회마을
DOI
ScienceOn
|
11 |
Wikipedia, "Minimum Spanning Tree," http://en.wikipedia.org/wiki/Minimum_spanning_tree, Wikimedia Foundation Inc., 2013.
|
12 |
R. Machado and C. M. H. de Figueiredo, "A Decomposition for Total-coloring Graphs of Maximum Degree 2," Cologne-Twente Workshop, 2008.
|
13 |
Wikipedia, "Peterson Graph," http://en.wikipedia.org/wiki/Peterson_graph,Wikimedia Foundation Inc., 2013.
|
14 |
E. Weisstein, "Complete Graph," http://mathworld.wolfram.com/Complete graph, Wolfram Research Inc., 2013.
|