A278375 Edge-distinguishing chromatic number of ladder graph with 2n vertices.

1, 3, 4, 5, 5, 6, 7, 7, 7, 8, 8, 8, 9, 9

Offset: 1

Author

Nathaniel Benjamin, Nov 19 2016

Keywords

• nonn
• more

References

• O. Frank, F. Harary, and M. J. Plantholt, The line-distinguishing chromatic number of a graph, pp. 14, 241-252 of Ars Combinatoria (1982).

Links

• K. Al-Wahabi, R. Bari, F. Harary and D. Ullman, The edge-distinguishing chromatic number of paths and cycles, 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.