A sublinear bound on the chromatic index of multigraphs

Discrete Mathematics

Volumn 202, Issue 1-3, 1999, Pages 201-213

  Plantholt, Michael ^a  

^a ILLINOIS STATE UNIVERSITY   (United States)

Author keywords

Chromatic index; Multigraph

Indexed keywords

EID: 0042707119     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00356-2     Document Type: Article

References (12)

1. L.D. Andersen, On edge-colouring of graphs, Math. Scand. 40 (1974) 161-175.
2. M.K. Goldberg, On multigraphs of almost maximal chromatic class, Diskret. Analiz 23 (1973) 3-7 (in Russian).
3. M.K. Goldberg, Edge-colorings of multigraphs: recoloring technique, J. Graph Theory 8 (1984) 123-137.
4. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
5. J. Kahn, Asymptotics of the chromatic index for multigraphs, J. Combin. Theory, Ser. B 68 (1996) 233-254.
6. O. Marcotte, On the chromatic index of multigraphs and a conjecture of Seymour (I), J. Combin. Theory Ser. B 41 (1986) 306-331.
7. T. Nishizeki, K. Kashiwagi, An upper bound on the chromatic index of multigraphs, in: Y. Alavi et al. (Eds.), Graph Theory with Applications to Algorithms and Computer Science, Wiley, New York, 1985, pp. 595-604.
8. M. Plantholt, An order-based upper bound on the chromatic index of a multigraph, J. Combin. Inform. System Sci. 16 (1992) 271-280.
9. M. Plantholt, An improved order-based bound on the chromatic index of a multigraph, Congr. Numer. 103 (1994) 129-142.
10. P.D. Seymour, On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte, Proc. London Math. Soc. (3) 38 (1979) 423-460.
11. C.E. Shannon, A theorem on coloring the lines of a network, J. Math. Phys. 28 (1949) 148-151.
12. V.G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz 3 (1964) 25-30 (in Russian).