Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Graph colouring")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1725

  • Page / 69
Export

Selection :

  • and

Total colorings of degenerated graphsISOBE, Shuji; XIAO ZHOU; NISHIZEKI, Takao et al.Lecture notes in computer science. 2001, pp 506-517, issn 0302-9743, isbn 3-540-42287-0Conference Paper

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

Randomly colouring graphs with girth five and large maximum degreeLAP CHI LAU; MOLLOY, Michael.Lecture notes in computer science. 2006, pp 665-676, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Counting and sampling H-colouringsDYER, Martin; GOLDBERG, Leslie A; JERRUM, Mark et al.Lecture notes in computer science. 2002, pp 51-67, issn 0302-9743, isbn 3-540-44147-6, 17 p.Conference Paper

All structured programs have small tree width and good register allocationTHORUP, M.Information and computation (Print). 1998, Vol 142, Num 2, pp 159-181, issn 0890-5401Article

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

On the 2-colorability of random hypergraphsACHLIOPTAS, Dimitris; MOORE, Cristopher.Lecture notes in computer science. 2002, pp 78-90, issn 0302-9743, isbn 3-540-44147-6, 13 p.Conference Paper

Efficient algorithms for weighted colorings of series-parallel graphsXIAO ZHOU; NISHIZEKI, Takao.Lecture notes in computer science. 2001, pp 514-524, issn 0302-9743, isbn 3-540-42985-9Conference Paper

New proof makes light work of partial latin squaresCIPRA, B.Science (Washington, D.C.). 1994, Vol 265, Num 5168, issn 0036-8075, p. 29Article

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

  • Page / 69