|
|
Journals in DBLP
- Jaroslav Nesetril, Gerhard J. Woeginger
Graph colorings. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:349, n:1, pp:1- [Journal]
- Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
On algorithms for (P5, gem)-free graphs. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:349, n:1, pp:2-21 [Journal]
- Hans L. Bodlaender, Fedor V. Fomin
Equitable colorings of bounded treewidth graphs. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:349, n:1, pp:22-30 [Journal]
- Andrei A. Bulatov
H-Coloring dichotomy revisited. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:349, n:1, pp:31-39 [Journal]
- Josep Díaz, Vishal Sanwalani, Maria J. Serna, Paul G. Spirakis
The chromatic and clique numbers of random scaled sector graphs. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:349, n:1, pp:40-51 [Journal]
- Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
List matrix partitions of chordal graphs. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:349, n:1, pp:52-66 [Journal]
- Jirí Fiala, Daniël Paulusma
A complete complexity classification of the role assignment problem. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:349, n:1, pp:67-81 [Journal]
- Alexandr V. Kostochka, Kittikorn Nakprasit
On equitable Delta-coloring of graphs with low average degree. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:349, n:1, pp:82-91 [Journal]
- Anja Kohl, Jens Schreyer, Zsolt Tuza, Margit Voigt
List version of L(d, s)-labelings. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:349, n:1, pp:92-98 [Journal]
- Daniel Král
Group coloring is Pi2P-complete. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:349, n:1, pp:99-111 [Journal]
- Edita Mácajová, Martin Skoviera
Fano colourings of cubic graphs and the Fulkerson Conjecture. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:349, n:1, pp:112-120 [Journal]
|
