Some bounds on the injective chromatic number of graphs

被引：33

作者：

Doyon, Alain ^{[1
]}

Hahn, Gena ^{[1
]}

Raspaud, Andre ^{[2
]}

机构：

[1] Univ Montreal, Dept Informat & Rech Operat, Montreal, PQ H3C 3J7, Canada

[2] Univ Bordeaux, Rech Informat Lab, Bordeaux, France

来源：

关键词：

Vertex colouring; Chromatic number; Injective; Hypercube;

D O I：

10.1016/j.disc.2009.04.020

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：585 / 590

页数：6

共 5 条

[1]

Bondy J. A., 1976, Graduate Texts in Mathematics, V290

[2] MINIMUM PARTITION OF A MATROID INTO INDEPENDENT SUBSETS [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2) :67-+

[3] On the injective chromatic number of graphs [J].

Hahn, G ;

Kratochvíl, J ;

Sirán, J ;

Sotteau, D .

[4]

LUZAR B, 2006, INJECTIVE COLORINGS

[5]

SHEINERMANN ER, 1997, WILEY INTERSCIENCE S