|
%I #6 Nov 27 2016 21:14:56
%S 1,3,4,5,5,6,7,7,7,8,8,8,9,9
%N Edge-distinguishing chromatic number of ladder graph with 2n vertices.
%D O. Frank, F. Harary, and M. J. Plantholt, The line-distinguishing chromatic number of a graph, pp. 14, 241-252 of Ars Combinatoria (1982).
%H K. Al-Wahabi, R. Bari, F. Harary and D. Ullman, <a href="http://dx.doi.org/10.1016/S0167-5060(08)70446-1">The edge-distinguishing chromatic number of paths and cycles</a>, pp. 17-22 of Graph Theory in Memory of G. A. Dirac (Sandbjerg, 1985). Edited by L. D. Andersen et al., Annals of Discrete Mathematics, 41. North-Holland Publishing Co., Amsterdam-New York, 1989.
%K nonn,more
%O 1,2
%A _Nathaniel Benjamin_, Nov 19 2016
|
