Items where Author is "Kratochvíl, J."

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | No Grouping
Number of items: 8.

1993

DateAuthor/TitleDocument Type
1993Kratochvíl, J. and Savicky, P. and Tuza, Zsolt
One more occurrence of variables makes satisfiability jump from trivial to NP-complete
Article

1998

DateAuthor/TitleDocument Type
1998Kratochvíl, J. and Tuza, Zsolt and Voigt, M.
Brooks-type theorems for choosability with separation
Article
1998Kratochvíl, J. and Tuza, Zsolt and Voigt, M.
Complexity of choosing subsets from color sets
Article

1999

DateAuthor/TitleDocument Type
1999Kratochvíl, J. and Tuza, Zsolt and Voigt, M.
New trends in the theory of graph colorings: Choosability and list colorings
Conference or Workshop Item
1999Kratochvíl, J. and Tuza, Zsolt
Rankings of directed graphs
Conference or Workshop Item

2000

DateAuthor/TitleDocument Type
2000Kratochvíl, J. and Tuza, Zsolt
On the complexity of bicoloring clique hypergraphs of graphs. (Extended abstract)
Conference or Workshop Item

2001

DateAuthor/TitleDocument Type
2001Krá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

DateAuthor/TitleDocument Type
2002Kratochvíl, J. and Tuza, Zsolt
On the complexity of bicoloring clique hypergraphs of graphs
Article
This list was generated on Fri Apr 26 03:10:20 2019 CEST.