A note on M2-edge colorings of graphs

• Autorzy: Czap J.

Identyfikatory

DOI

http://dx.doi.Org/10.7494/OpMath.2015.35.3.287

• Języki publikacji: EN

Abstrakty

EN

An edge coloring φ of a graph G is called an M2-edge coloring if [formula] every vertex v of G, where φ(v) is the set of colors of edges incident with v. Let K2(G) denote the maximum number of colors used in an M2-edge coloring of G. Let G1, G2 and G3 be graphs such that G1 ⊆ G2 ⊆ G3. In this paper we deal with the following question: Assuming that K2(G1) = K2(G3), does it hold K2(G1) = K2(G2) = K2(G3)?

Słowa kluczowe

EN

edge colouring; graph

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2015
• Tom: Vol. 35, no. 3
• Strony: 287--291
• Opis fizyczny: Bibliogr. 10 poz.

Twórcy

autor

Czap J.

• Department of Applied Mathematics and Business Informatics Faculty of Economics, Technical University of Kosice Nemcovej 32, 040 01 Kosice, Slovakia

Bibliografia

• [1] K. Budajova, J. Czap, M^-edge coloring and maximum matching of graphs, Int. J. Pure Appl. Math. 88 (2013), 161-167.
• [2] H. Choi, S.L. Hakimi, Scheduling file transfers for trees and odd cycles, SIAM J. Corn-put. 16 (1987), 162-168.
• [3] E.G. Coffman Jr., M.R. Garey, D.S. Johnson, A.S. LaPaugn, Scheduling file transfers, SIAM J. Comput. 14 (1985), 744-780.
• [4] J. Czap, Mi-edge colorings of graphs, Appl. Math. Sciences 5 (2011), 2437-2442.
• [5] S.L. Hakimi, O. Kariv, A generalization of edge-coloring in graphs, J. Graph Theory 10 (1986), 139-154.
• [6] H. Krawczyk, M. Kubale, An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Trans. Comput. C-34 (1985), 869-872.
• [7] S. Nakano, T. Nishizeki, N. Saito, On the f-coloring of multigraphs, IEEE Trans. Cir¬cuits Syst. 35 (1988), 345-353.
• [8] X. Zhang, G. Liu, Some sufficient conditions for a graph to be of Cf 1, Appl. Math. Lett. 19 (2006), 38-44.
• [9] X. Zhang, G. Liu, f-colorings of some graphs of f-class 1, Acta Math. Sin., Engl. Ser. 24 (2008), 743-748.
• [10] X. Zhang, G. Liu, Some graphs of class 1 for f -colorings, Appl. Math. Lett. 21 (2008), 23-29.