Edge coloring numbers of some regular graphs
HTML articles powered by AMS MathViewer
- by E. T. Parker PDF
- Proc. Amer. Math. Soc. 37 (1973), 423-424 Request permission
Abstract:
The graph composed of k subgraphs, each the totally-disconnected graph with n nodes, arranged in a cycle, can be edge-colored with 2n colors unless n and k are both odd.References
- V. G. Vizing, On an estimate of the chromatic class of a $p$-graph, Diskret. Analiz 3 (1964), 25–30 (Russian). MR 180505
Additional Information
- © Copyright 1973 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 37 (1973), 423-424
- MSC: Primary 05C15
- DOI: https://doi.org/10.1090/S0002-9939-1973-0313103-0
- MathSciNet review: 0313103