Volume 349; Issue 1

Theoretical Computer Science

Volume 349; Issue 1
1

Graph colorings

Jaroslav Nešetřil, Gerhard Woeginger
Journal:
Theoretical Computer Science
Year:
2005
Language:
english
File:
PDF, 96 KB
english, 2005
2

On algorithms for (,gem)-free graphs

Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
Journal:
Theoretical Computer Science
Year:
2005
Language:
english
File:
PDF, 321 KB
english, 2005
3

Equitable colorings of bounded treewidth graphs

Hans L. Bodlaender, Fedor V. Fomin
Journal:
Theoretical Computer Science
Year:
2005
Language:
english
File:
PDF, 212 KB
english, 2005
4

H-Coloring dichotomy revisited

Andrei A. Bulatov
Journal:
Theoretical Computer Science
Year:
2005
Language:
english
File:
PDF, 227 KB
english, 2005
5

A complete complexity classification of the role assignment problem

Jiří Fiala, Daniël Paulusma
Journal:
Theoretical Computer Science
Year:
2005
Language:
english
File:
PDF, 287 KB
english, 2005
6

On equitable -coloring of graphs with low average degree

A.V. Kostochka, K. Nakprasit
Journal:
Theoretical Computer Science
Year:
2005
Language:
english
File:
PDF, 226 KB
english, 2005
7

List version of -labelings

Anja Kohl, Jens Schreyer, Zsolt Tuza, Margit Voigt
Journal:
Theoretical Computer Science
Year:
2005
Language:
english
File:
PDF, 189 KB
english, 2005
8

Group coloring is -complete

Daniel Král’
Journal:
Theoretical Computer Science
Year:
2005
Language:
english
File:
PDF, 284 KB
english, 2005
9

Fano colourings of cubic graphs and the Fulkerson Conjecture

Edita Máčajová, Martin Škoviera
Journal:
Theoretical Computer Science
Year:
2005
Language:
english
File:
PDF, 211 KB
english, 2005
10

Editorial board v-ix

Journal:
Theoretical Computer Science
Year:
2005
Language:
english
File:
PDF, 117 KB
english, 2005
11

List matrix partitions of chordal graphs

Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
Journal:
Theoretical Computer Science
Year:
2005
Language:
english
File:
PDF, 265 KB
english, 2005