M2-EDGE COLORINGS OF CACTI AND GRAPH JOINS

被引：7

作者：

Czap, Julius ^{[1
]}

Sugerek, Peter ^{[1
]}

Ivanco, Jaroslav ^{[2
]}

机构：

[1] Tech Univ Kosice, Fac Econ, Dept Appl Math & Business Informat, Kosice 04001, Slovakia

[2] Safarik Univ, Inst Math, Kosice 04001, Slovakia

来源：

DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2016年 / 36卷 / 01期

关键词：

cactus; edge coloring; graph join; SCHEDULING FILE TRANSFERS; F-COLORINGS;

D O I：

10.7151/dmgt.1842

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An edge coloring phi of a graph G is called an M-2-edge coloring if vertical bar phi(v)vertical bar <= 2 for every vertex v of G, where phi(v) is the set of colors of edges incident with v. Let kappa(2) (G) denote the maximum number of colors used in an M-2-edge coloring of G. In this paper we determine kappa(2)(G) for trees, cacti, complete multipartite graphs and graph joins.

引用

页码：59 / 69

页数：11

共 14 条

[1]

Budajova K., 2013, INT J PURE APPL MATH, V88, P161, DOI [10.12732/ijpam.v88i2.1, DOI 10.12732/IJPAM.V88I2.1]

[2] SCHEDULING FILE TRANSFERS FOR TREES AND ODD CYCLES [J].

CHOI, HA ;

HAKIMI, SL .

SIAM JOURNAL ON COMPUTING, 1987, 16 (01) :162-168

[3]

COFFMAN EG, 1985, SIAM J COMPUT, V14, P744, DOI 10.1137/0214054

[4]

Czap J., 2011, Appl. Math. Sci., V5, P2437

[5] A NOTE ON M-2-EDGE COLORINGS OF GRAPHS [J].

Czap, Julius .

OPUSCULA MATHEMATICA, 2015, 35 (03) :287-291

[6]

Gionfriddo M., 2002, COMPUTER SCI J MOLDO, V10, P81

[7]

HAKIMI SL, 1986, J GRAPH THEOR, V10, P139

[8]

KRAWCZYK H, 1985, IEEE T COMPUT, V34, P869, DOI 10.1109/TC.1985.1676647

[9] ON THE F-COLORING OF MULTIGRAPHS [J].

NAKANO, SI ;

NISHIZEKI, T ;

SAITO, N .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1988, 35 (03) :345-353

[10]

Sitton D., 1996, Furman Univ. Electron. J. Undergraduate Math, V1, P6

← 1 2 →