New approximation guarantee for chromatic numberARORA, Sanjeev; CHLAMTAC, Eden; CHARIKAR, Moses et al.Annual ACM symposium on theory of computing. 2006, pp 215-224, isbn 1-59593-134-1, 1Vol, 10 p.Conference Paper

Minimum chromaticity of circulant graphsOBRADOVIC, Nenad; PETERS, Joseph; RUZIC, Goran et al.Discrete mathematics. 2005, Vol 299, Num 1-3, pp 288-296, issn 0012-365X, 9 p.Article

Coloring the Cartesian sum of graphsDER-FEN LIU, Daphne; XUDING ZHU.Discrete mathematics. 2008, Vol 308, Num 24, pp 5928-5936, issn 0012-365X, 9 p.Article

The Erdos-Faber-Lovasz conjecture for dense hypergraphsSANCHEZ-ARROYO, Abdon.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 991-992, issn 0012-365X, 2 p.Conference Paper

Rank, term rank, and chromatic numberFISHKIND, Donniell E; KOTLOV, Andrei.Discrete mathematics. 2002, Vol 250, Num 1-3, pp 253-257, issn 0012-365XArticle

A DICHOTOMY CHARACTERIZING ANALYTIC DIGRAPHS OF UNCOUNTABLE BOREL CHROMATIC NUMBER IN ANY DIMENSIONLECOMTE, Dominique.Transactions of the American Mathematical Society. 2009, Vol 361, Num 8, pp 4181-4193, issn 0002-9947, 13 p.Article

Defining numbers in some of the Harary graphsMOJDEH, D. A; KAZEMI, A. P.Applied mathematics letters. 2009, Vol 22, Num 6, pp 922-926, issn 0893-9659, 5 p.Article

5-regular graphs are 3-colorable with positive probabilityDIAZ, J; GRAMMATIKOPOULOS, G; KAPORIS, A. C et al.Lecture notes in computer science. 2005, pp 215-225, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 11 p.Conference Paper

Colouring 4-cycle systems with equitably coloured blocksGIONFRIDDO, Mario; QUATTROCCHI, Gaetano.Discrete mathematics. 2004, Vol 284, Num 1-3, pp 137-148, issn 0012-365X, 12 p.Article

Homomorphisms and oriented colorings of equivalence classes of oriented graphsKLOSTERMEYER, William F; MACGILLIVRAY, Gary.Discrete mathematics. 2004, Vol 274, Num 1-3, pp 161-172, issn 0012-365X, 12 p.Article

Invariants of E-graphsHAYNES, T. W; LAWSON, L. M.International journal of computer mathematics. 1995, Vol 55, Num 1-2, pp 19-27, issn 0020-7160Article

7-critical graphs of bounded genusMOHAR, B.Discrete mathematics. 1993, Vol 112, Num 1-3, pp 279-281, issn 0012-365XArticle

The harmonious chromatic number of a complete binary and trinary treeZHIKANG LU.Discrete mathematics. 1993, Vol 118, Num 1-3, pp 165-172, issn 0012-365XArticle

Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbersBROWN, J. I; HOSHINO, R.Discrete mathematics. 2009, Vol 309, Num 8, pp 2223-2232, issn 0012-365X, 10 p.Article

A notion of cross-perfect bipartite graphsDAWANDE, Milind.Lecture notes in computer science. 2001, pp 409-413, issn 0302-9743, isbn 3-540-42494-6Conference Paper

The vertex-face total chromatic number of Halin graphsLAM, P. C. B; ZHANG, Z.Networks (New York, NY). 1997, Vol 30, Num 3, pp 167-170, issn 0028-3045Article

The total chromatic number of graphs having large maximum degreeHILTON, A. J. W; HIND, H. R.Discrete mathematics. 1993, Vol 117, Num 1-3, pp 127-140, issn 0012-365XArticle

Star chromatic numbers and products of graphsXUDING ZHU.Journal of graph theory. 1992, Vol 16, Num 6, pp 557-569, issn 0364-9024Article

A generalization of the Erdös-Ko-Rado theoremALISHAHI, Meysam; HAJIABOLHASSAN, Hossein; TAHERKHANI, Ali et al.Discrete mathematics. 2010, Vol 310, Num 1, pp 188-191, issn 0012-365X, 4 p.Article

5-Chromatic even triangulations on surfacesNAKAMOTO, Atsuhiro.Discrete mathematics. 2008, Vol 308, Num 12, pp 2571-2580, issn 0012-365X, 10 p.Article

Set colourings of graphsBOLLOBAS, Béla; THOMASON, Andrew.Discrete mathematics. 2006, Vol 306, Num 10-11, pp 948-952, issn 0012-365X, 5 p.Article

Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfacesNAKAMOTO, Atsuhiro; NEGAMI, Seiya; OTA, Katsuhiro et al.Discrete mathematics. 2004, Vol 285, Num 1-3, pp 211-218, issn 0012-365X, 8 p.Article

Tight relation between the circular chromatic number and the girth of series-parallel graphsZHISHI PAN; XUDING ZHU.Discrete mathematics. 2002, Vol 254, Num 1-3, pp 393-404, issn 0012-365XArticle

The hardness of 3-uniform hypergraph coloringDINUR, Irit; REGEV, Oded; SMYTH, Clifford et al.Annual Symposium on Foundations of Computer Science. 2002, pp 33-40, isbn 0-7695-1822-2, 8 p.Conference Paper

Critical and anticritical edges in perfect graphsWAGLER, Annegret.Lecture notes in computer science. 2001, pp 317-327, issn 0302-9743, isbn 3-540-42707-4Conference Paper