On a Lovász-type lemma, applied to Brooks' theorem for list-colouringTVERBERG, Helge.Discrete mathematics. 2011, Vol 311, Num 17, pp 1995-1997, issn 0012-365X, 3 p.Article

Une approche pour un chargement contextuel de services dans les environnements pervasifsAMIRA BEN HAMIDA; LE MOUËL, Frédéric; FRENOT, Stéphane et al.Ingénierie des systèmes d'information (2001). 2008, Vol 13, Num 3, pp 59-82, issn 1633-1311, 24 p.Article

Algorithms for finding distance-edge-colorings of graphsITO, Takehiro; KATO, Akira; XIAO ZHOU et al.Lecture notes in computer science. 2005, pp 798-807, issn 0302-9743, isbn 3-540-28061-8, 10 p.Conference Paper

Weakened Ramsey numbersHARBORTH, H; MÖLLER, M.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 279-284, issn 0166-218XConference Paper

On the optimality of coloring with a latticeMERKSAMER, Yael; ETZION, Tuvi.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 21Conference Paper

Rainbow coloring the cubeFAUDREE, R. J; GYARFAS, A; LESNIAK, L et al.Journal of graph theory. 1993, Vol 17, Num 5, pp 607-612, issn 0364-9024Article

Fixed parameter algorithms for counting and deciding bounded restrictive list H-coloringsDIAZ, Josep; SERNA, Maria; THILIKOS, Dimitrios M et al.Lecture notes in computer science. 2004, pp 275-286, issn 0302-9743, isbn 3-540-23025-4, 12 p.Conference Paper

Multicoloring: Problems and techniquesHALLDORSSON, Magnus M; KORTSARZ, Guy.Lecture notes in computer science. 2004, pp 25-41, issn 0302-9743, isbn 3-540-22823-3, 17 p.Conference Paper

The complexity of restrictive H-coloringDIAZ, Josep; SERNA, Maria; THILIKOS, Dimitrios M et al.Lecture notes in computer science. 2002, pp 126-137, issn 0302-9743, isbn 3-540-00331-2, 12 p.Conference Paper

Further results on T-coloring and frequency assignment problemsARUNDHATI RAYCHAUDHURI.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 4, pp 605-613, issn 0895-4801Article

Online problems, pathwidth, and persistenceDOWNEY, Rodney G; MCCARTIN, Catherine.Lecture notes in computer science. 2004, pp 13-24, issn 0302-9743, isbn 3-540-23071-8, 12 p.Conference Paper

Some colouring problems for Paley graphsMAISTRELLI, E; PENMAN, D. B.Discrete mathematics. 2006, Vol 306, Num 1, pp 99-106, issn 0012-365X, 8 p.Article

Four colors do not sufficeHUDSON, Hud.The American mathematical monthly. 2003, Vol 110, Num 5, pp 417-423, issn 0002-9890, 7 p.Article

Never trust Victor: An alternative resettable zero-knowledge proof systemMÜLLER, Olaf; NÜSKEN, Michael.Lecture notes in computer science. 2002, pp 79-92, issn 0302-9743, isbn 3-540-00263-4, 14 p.Conference Paper

Graphes parfaits: étude structurelle et algorithmes de coloration = Perfect graphs: structural study and colouring algorithmsRusu, Irena; Fouquet, J.-L.1994, 126 p.Thesis

Connectivity of distance graphsCURRIE, J. D.Discrete mathematics. 1992, Vol 103, Num 1, pp 91-94, issn 0012-365XArticle

Local and global proportionalityWOODALL, D. R.Discrete mathematics. 1992, Vol 102, Num 3, pp 315-328, issn 0012-365XArticle

Register allocation by priority-based coloringCHOW, Frederick; HENNESSY, John.ACM SIGPLAN notices. 2004, Vol 39, Num 4, pp 93-103, issn 1523-2867, 11 p.Article

Graph coloring and the immersion orderABU-KHZAM, Faisal N; LANGSTON, Michael A.Lecture notes in computer science. 2003, pp 394-403, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

Two-edge colorings of graphs with bounded degree in both colorsGYÖRI, Ervin; SCHELP, R. H.Discrete mathematics. 2002, Vol 249, Num 1-3, pp 105-110, issn 0012-365XConference Paper

An NC parallel algorithm for edge-coloring series-parallel multigraphsZHOU, X; SUZUKI, H; NISHIZEKI, T et al.Journal of algorithms (Print). 1997, Vol 23, Num 2, pp 359-374, issn 0196-6774Article

Global register allocation based on graph fusionLUEH, G.-Y; GROSS, T; ADL-TABATABAI, A.-R et al.Lecture notes in computer science. 1997, pp 246-265, issn 0302-9743, isbn 3-540-63091-0Conference Paper

Coloration et produits de graphes = Coloring and products of graphsGravier, Sylvain; Duchet, P.1996, 194 p.Thesis

A charming class of perfectly orderable graphsHOANG, C. T; MAFFRAY, F; OLARIU, S et al.Discrete mathematics. 1992, Vol 102, Num 1, pp 67-74, issn 0012-365XArticle

Examination scheduling : a computerized applicationBALAKRISHNAN, N.Omega (Oxford). 1991, Vol 19, Num 1, pp 37-41, issn 0305-0483Article