Items where Author is "Kratochvíl, J."
 | Up a level |
Number of items: 8.
1993
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 1993 | Kratochvíl, J. and Savicky, P. and Tuza, Zsolt One more occurrence of variables makes satisfiability jump from trivial to NP-complete | Article |
1998
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 1998 | Kratochvíl, J. and Tuza, Zsolt and Voigt, M. Brooks-type theorems for choosability with separation | Article | |
| 1998 | Kratochvíl, J. and Tuza, Zsolt and Voigt, M. Complexity of choosing subsets from color sets | Article |
1999
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 1999 | Kratochvíl, J. and Tuza, Zsolt and Voigt, M. New trends in the theory of graph colorings: Choosability and list colorings | Conference or Workshop Item | |
| 1999 | Kratochvíl, J. and Tuza, Zsolt Rankings of directed graphs | Conference or Workshop Item |
2000
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2000 | Kratochvíl, J. and Tuza, Zsolt On the complexity of bicoloring clique hypergraphs of graphs. (Extended abstract) | Conference or Workshop Item |
2001
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2001 | Král, D. and Kratochvíl, J. and Tuza, Zsolt and Woegiger, G. Complexity of coloring graphs without forbidden induced subgraphs | Conference or Workshop Item |
2002
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2002 | Kratochvíl, J. and Tuza, Zsolt On the complexity of bicoloring clique hypergraphs of graphs | Article |
