prof. RNDr. Daniel Kráľ, Ph.D., DSc.
profesor – Katedra teorie programování
kancelář: C517
Botanická 554/68a
602 00 Brno
telefon: | 549 49 6337 |
---|---|
e‑mail: |
sociální a akademické sítě: |
---|
Počet publikací: 176
2004
-
Borodin's conjecture on diagonal coloring is false
-
Edge-disjoint odd cycles in planar graphs
-
Group coloring and list group coloring are Pi(P)(2)-complete
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, rok: 2004, ročník: 3153
-
Hajos' theorem for list coloring
-
It is tough to be a plumber
-
Locally consistent constraint satisfaction problems - (Extended abstract)
AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, rok: 2004, ročník: 3142
-
Mixed hypercacti
-
On feasible sets of mixed hypergraphs
-
Pancyclicity of strong products of graphs