论文信息 - Some maximum multigraphs and adge/vertex distance colourings

Some maximum multigraphs and adge/vertex distance colourings

Shannon-Vizing-type problems concerning the upper bound for a distance chromatic index of multigraphs G in terms of the maximum degree ¢(G) are studied. Conjectures generalizing those related to the strong chromatic index are presented. The chromatic d-index and chromatic d-number of paths, cycles, trees and some hypercubes are determined. Among hypercubes, however, the exact order of their growth is found.

Zdzislaw Skupien

[1] Florica Kramer. Brève communication. Sur le nombre chromatique $K(p, G)$ des graphes , 1972 .

[2] Lars Døvling Anderson. The strong chromatic index of a cubic graph is at most 10 , 1992 .

[3] Zsolt Tuza,et al. Induced matchings in bipartite graphs , 1989, Discret. Math..

[4] Zsolt Tuza,et al. The maximum number of edges in 2K2-free graphs of bounded degree , 1990, Discret. Math..

[5] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[6] Neil J. A. Sloane,et al. The theory of error-correcting codes (north-holland , 1977 .

[7] Jean-Claude Bermond,et al. Surveys in Combinatorics: GRAPHS AND INTERCONNECTION NETWORKS: DIAMETER AND VULNERABILITY , 1983 .

[8] Henry P. Kramer,et al. On the Generalized Chromatic Number , 1986 .

[9] C. Shannon. A Theorem on Coloring the Lines of a Network , 1949 .

[10] R. Schelp,et al. THE STRONG CHROMATIC INDEX OF GRAPHS , 1990 .

[11] Stanley Wagon,et al. A bound on the chromatic number of graphs without certain induced subgraphs , 1980, J. Comb. Theory, Ser. B.

[12] William T. Trotter,et al. Induced matchings in cubic graphs , 1993, J. Graph Theory.

[13] V. G. Vizing. The chromatic class of a multigraph , 1965 .