Masarykova univerzita

Výpis publikací

česky | in English

Filtrování publikací

    2023

    1. Cycles of a given length in tournaments
      GRZESIK, Andrzej, Daniel KRÁĽ, Laszlo M LOVASZ a Jan VOLEC. Cycles of a given length in tournaments. Journal of Combinatorial Theory. Series B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2023, roč. 158, č. 1, s. 117-145. ISSN 0095-8956. doi:10.1016/j.jctb.2022.07.007.
      Podrobněji: https://is.muni.cz/publication/2266377/cs
    2. No additional tournaments are quasirandom-forcing
      HANCOCK, Robert Arthur, Adam KABELA, Daniel KRÁĽ, Taisa MARTINS, Roberto PARENTE, Fiona SKERMAN a Jan VOLEC. No additional tournaments are quasirandom-forcing. European Journal of Combinatorics. 2023, roč. 108, č. 1, s. 1-10. ISSN 0195-6698. doi:10.1016/j.ejc.2022.103632.
      Podrobněji: https://is.muni.cz/publication/2245118/cs
    3. Quasirandom-Forcing Orientations of Cycles
      GRZESIK, Andrzej, Daniel IĽKOVIČ, Bartłomiej KIELAK a Daniel KRÁĽ. Quasirandom-Forcing Orientations of Cycles. SIAM JOURNAL ON DISCRETE MATHEMATICS. UNITED STATES: SIAM PUBLICATIONS, 2023, roč. 37, č. 4, s. 2689-2716. ISSN 0895-4801. doi:10.1137/23M1548700.
      Podrobněji: https://is.muni.cz/publication/2339297/cs

    2022

    1. Density maximizers of layered permutations
      KABELA, Adam, Daniel KRÁĽ, Jon Andrew NOEL a Théo PIERRON. Density maximizers of layered permutations. Electronic Journal of Combinatorics. 2022, roč. 29, č. 3, s. 1-21. ISSN 1077-8926. doi:10.37236/10781.
      Podrobněji: https://is.muni.cz/publication/2245922/cs
    2. Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming
      BRIAŃSKI, Marcin, Martin KOUTECKÝ, Daniel KRÁĽ, Kristýna PEKÁRKOVÁ a Felix SCHRÖDER. Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming. In Proceedings of the 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. s. "29:1"-"29:20", 20 s. ISBN 978-3-95977-235-8. doi:10.4230/LIPIcs.ICALP.2022.29.
      Podrobněji: https://is.muni.cz/publication/1876400/cs
    3. Inducibility and universality for trees
      CHAN, Timothy, F. N., Daniel KRÁĽ, Bojan MOHAR a David R. WOOD. Inducibility and universality for trees. Combinatorial Theory. 2022, roč. 2, 3.2, s. 1-31. ISSN 2766-1334. doi:10.5070/C62359150.
      Podrobněji: https://is.muni.cz/publication/2245924/cs
    4. Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming
      CHAN, Timothy Fong Nam, Jacob COOPER, Martin KOUTECKÝ, Daniel KRÁĽ a Kristýna PEKÁRKOVÁ. Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming. SIAM JOURNAL ON COMPUTING. UNITED STATES: SIAM PUBLICATIONS, 2022, roč. 51, č. 3, s. 664-700. ISSN 0097-5397. doi:10.1137/20M1353502.
      Podrobněji: https://is.muni.cz/publication/2211686/cs
    5. Non-Bipartite K-Common Graphs
      KRÁĽ, Daniel, Jonathan A NOEL, Sergey NORIN, Jan VOLEC a Fan WEI. Non-Bipartite K-Common Graphs. COMBINATORICA. GERMANY: SPRINGER HEIDELBERG, 2022, roč. 42, č. 1, s. 87-114. ISSN 0209-9683. doi:10.1007/s00493-020-4499-9.
      Podrobněji: https://is.muni.cz/publication/2245132/cs
    6. Packing and covering directed triangles asymptotically
      COOPER, Jacob, Andrzej GRZESIK, Adam KABELA a Daniel KRÁĽ. Packing and covering directed triangles asymptotically. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2022, roč. 101, č. 103462, s. 1-9. ISSN 0195-6698. doi:10.1016/j.ejc.2021.103462.
      Podrobněji: https://is.muni.cz/publication/1824821/cs
    7. Quasirandom Latin squares
      COOPER, Jacob, Daniel KRÁĽ, Ander LAMAISON VIDARTE a Josef Samuel MOHR. Quasirandom Latin squares. Random Structures & Algorithms. United Kingdom: John Wiley and Sons Ltd, 2022, roč. 61, č. 2, s. 298-308. ISSN 1098-2418. doi:10.1002/rsa.21060.
      Podrobněji: https://is.muni.cz/publication/1802751/cs
    8. Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
      DVORAK, Zdenek, Daniel KRÁĽ a Robin THOMAS. Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. Journal of Combinatorial Theory. Series B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2022, roč. 152, January, s. 483-504. ISSN 0095-8956. doi:10.1016/j.jctb.2021.07.002.
      Podrobněji: https://is.muni.cz/publication/2244123/cs

    2021

    1. Coloring graphs by translates in the circle
      CANDELA, Pablo, Carlos CATALÁ, Robert Arthur HANCOCK, Adam KABELA, Daniel KRÁĽ, Ander LAMAISON VIDARTE a Lluís VENA. Coloring graphs by translates in the circle. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2021, roč. 96, č. 103346, s. 1-18. ISSN 0195-6698. doi:10.1016/j.ejc.2021.103346.
      Podrobněji: https://is.muni.cz/publication/1824817/cs
    2. Cyclic coloring of plane graphs with maximum face size 16 and 17
      DVOŘÁK, Zdeněk, Michael HEBDIGE, Filip HLÁSEK, Daniel KRÁĽ a Jonathan NOEL. Cyclic coloring of plane graphs with maximum face size 16 and 17. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2021, roč. 94, č. 103287, s. 1-17. ISSN 0195-6698. doi:10.1016/j.ejc.2020.103287.
      Podrobněji: https://is.muni.cz/publication/1824818/cs
    3. Hypergraphs with Minimum Positive Uniform Turán Density
      GARBE, Frederik, Daniel KRÁĽ a Ander LAMAISON VIDARTE. Hypergraphs with Minimum Positive Uniform Turán Density. In Trends in Mathematics, Volume 14, Extended Abstracts of EuroComb 2021, European Conference on Combinatorics, Graph Theory and Applications. Barcelona: Birkhäuser, 2021. s. 148-153. ISBN 978-3-030-83822-5. doi:10.1007/978-3-030-83823-2_24.
      Podrobněji: https://is.muni.cz/publication/1860106/cs
    4. Strong Modeling Limits of Graphs with Bounded Tree-Width
      GRZESIK, Andrzej, Daniel KRÁĽ a Josef Samuel MOHR. Strong Modeling Limits of Graphs with Bounded Tree-Width. In Trends in Mathematics, Volume 14, Extended Abstracts of EuroComb 2021, European Conference on Combinatorics, Graph Theory and Applications. Barcelona: Birkhäuser, 2021. s. 273-279. ISBN 978-3-030-83822-5. doi:10.1007/978-3-030-83823-2_43.
      Podrobněji: https://is.muni.cz/publication/1860107/cs
    5. Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs
      DVOŘÁK, Zdeněk, Daniel KRÁĽ a Robin THOMAS. Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs. Journal of Combinatorial Theory. Series B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2021, roč. 150, September 2021, s. 270-304. ISSN 0095-8956. doi:10.1016/j.jctb.2020.09.001.
      Podrobněji: https://is.muni.cz/publication/1824819/cs
    6. Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies
      DVOŘÁK, Zdeněk, Daniel KRÁĽ a Robin THOMAS. Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. Journal of Combinatorial Theory. Series B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2021, roč. 150, September 2021, s. 244-269. ISSN 0095-8956. doi:10.1016/j.jctb.2020.04.006.
      Podrobněji: https://is.muni.cz/publication/1824820/cs

    2020

    1. Cycles of length three and four in tournaments
      CHAN, Timothy F. N., Andrzej GRZESIK, Daniel KRÁĽ a Jonathan A. NOEL. Cycles of length three and four in tournaments. Journal of Combinatorial Theory, Series A. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2020, roč. 175, č. 105276, s. 1-23. ISSN 0097-3165. doi:10.1016/j.jcta.2020.105276.
      Podrobněji: https://is.muni.cz/publication/1759844/cs
    2. Elusive extremal graphs
      GRZESIK, Andrzej, Daniel KRÁĽ a Laszlo Miklos LOVASZ. Elusive extremal graphs. Proceedings of the London mathematical society. Cambridge: Cambridge University Press, 2020, roč. 121, č. 6, s. 1685-1736. ISSN 0024-6115. doi:10.1112/plms.12382.
      Podrobněji: https://is.muni.cz/publication/1759842/cs
    3. Finitely Forcible Graphons with an Almost Arbitrary Structure
      KRÁĽ, Daniel, Laszlo M. LOVASZ, Jonathan A. NOEL a Jakub SOSNOVEC. Finitely Forcible Graphons with an Almost Arbitrary Structure. Discrete Analysis. CAMBRIDGE: ALLIANCE DIAMOND OPEN ACCESS JOURNALS, 2020, roč. 2020, č. 9, s. 1-36. ISSN 2397-3129. doi:10.19086/da.12058.
      Podrobněji: https://is.muni.cz/publication/1688903/cs
    4. Characterization of quasirandom permutations by a pattern sum
      CHAN, Timothy F. N., Daniel KRÁĽ, Jonathan A. NOEL, Yanitsa PEHOVA, Maryam SHARIFZADEH a Jan VOLEC. Characterization of quasirandom permutations by a pattern sum. Random Structures and Algorithms. HOBOKEN: WILEY, 2020, roč. 57, č. 4, s. 920-939. ISSN 1042-9832. doi:10.1002/rsa.20956.
      Podrobněji: https://is.muni.cz/publication/1759843/cs
    5. Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
      CHAN, Timothy Fong Nam, Jacob COOPER, Martin KOUTECKÝ, Daniel KRÁĽ a Kristýna PEKÁRKOVÁ. Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming. In Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), p. "26:1"-"26:19", 19 pp. 2020. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2020. s. "26:1"-"26:19", 19 s. ISBN 978-3-95977-138-2. doi:10.4230/LIPIcs.ICALP.2020.26.
      Podrobněji: https://is.muni.cz/publication/1684015/cs
    6. Permutations with fixed pattern densities
      KENYON, Richard, Daniel KRÁĽ, Charles RADIN a Peter WINKLER. Permutations with fixed pattern densities. Random Structures and Algorithms. HOBOKEN: WILEY, 2020, roč. 56, č. 1, s. 220-250. ISSN 1042-9832. doi:10.1002/rsa.20882.
      Podrobněji: https://is.muni.cz/publication/1646924/cs
    7. Three-coloring triangle-free graphs on surfaces III. Graphs of girth five
      DVORAK, Zdeněk, Daniel KRÁĽ a Robin THOMAS. Three-coloring triangle-free graphs on surfaces III. Graphs of girth five. Journal of Combinatorial Theory. Series B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2020, roč. 145, November 2020, s. 376-432. ISSN 0095-8956. doi:10.1016/j.jctb.2020.06.005.
      Podrobněji: https://is.muni.cz/publication/1688893/cs

    2019

    1. A bound on the inducibility of cycles
      KRÁĽ, Daniel, Sergey NORIN a Jan VOLEC. A bound on the inducibility of cycles. Journal of Combinatorial Theory, Series A. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2019, roč. 161, January 2019, s. 359-363. ISSN 0097-3165.
      Podrobněji: https://is.muni.cz/publication/1688767/cs
    2. Analytic representations of large graphs
      GRZESIK, Andrzej a Daniel KRÁĽ. Analytic representations of large graphs. In Surveys in Combinatorics 2019. Cambridge: Cambridge University Press, 2019. s. 57-88. ISBN 978-1-108-64909-4. doi:10.1017/9781108649094.003.
      Podrobněji: https://is.muni.cz/publication/1647317/cs
    3. Compactness and finite forcibility of graphons
      GLEBOV, Roman, Daniel KRÁĽ a Jan VOLEC. Compactness and finite forcibility of graphons. Journal of the European Mathematical Society. ZURICH: Springer, 2019, roč. 21, č. 10, s. 3199-3223. ISSN 1435-9855. doi:10.4171/JEMS/901.
      Podrobněji: https://is.muni.cz/publication/1646897/cs
    4. CYCLES OF LENGTH THREE AND FOUR IN TOURNAMENTS
      CHAN, Timothy Fong Nam, Andrzej GRZESIK, Daniel KRÁĽ a Jonathan Andrew NOEL. CYCLES OF LENGTH THREE AND FOUR IN TOURNAMENTS. Acta Mathematica Universitatis Comenianae. Bratislava: Comenius University, 2019, roč. 88, č. 3, s. 533-539. ISSN 0231-6986.
      Podrobněji: https://is.muni.cz/publication/1646921/cs
    5. Decomposing Graphs into Edges and Triangles
      KRÁĽ, Daniel, B LIDICKY, TL MARTINS a Y PEHOVA. Decomposing Graphs into Edges and Triangles. COMBINATORICS PROBABILITY & COMPUTING. NEW YORK: CAMBRIDGE UNIV PRESS, 2019, roč. 28, č. 3, s. 465-472. ISSN 0963-5483. doi:10.1017/S0963548318000421.
      Podrobněji: https://is.muni.cz/publication/1688766/cs
    6. Infinite-dimensional finitely forcible graphon
      GLEBOV, Roman, Tereza KLIMOŠOVÁ a Daniel KRÁĽ. Infinite-dimensional finitely forcible graphon. Proceedings of the London mathematical society. Cambridge: Cambridge University Press, 2019, roč. 118, č. 4, s. 826-856. ISSN 0024-6115. doi:10.1112/plms.12203.
      Podrobněji: https://is.muni.cz/publication/1646878/cs
    7. MORE NON-BIPARTITE FORCING PAIRS
      HUBAI, Tamás, Daniel KRÁĽ, Olaf PARCZYK a Yuri PERSON. MORE NON-BIPARTITE FORCING PAIRS. Acta Mathematica Universitatis Comenianae. Bratislava: Comenius University, 2019, roč. 88, č. 3, s. 819-825. ISSN 0231-6986.
      Podrobněji: https://is.muni.cz/publication/1646916/cs
    8. The step Sidorenko property and non-norming edge-transitive graphs
      KRÁĽ, Daniel, Taísa MARTINS, Péter Pál PACH a Marcin WROCHNA. The step Sidorenko property and non-norming edge-transitive graphs. Journal of Combinatorial Theory, Series A. San Diego: Academic Press, Elsevier, 2019, roč. 162, č. 1, s. 34-54. ISSN 0097-3165. doi:10.1016/j.jcta.2018.09.012.
      Podrobněji: https://is.muni.cz/publication/1646441/cs

    2018

    1. Finitely forcible graph limits are universal
      COOPER, Jacob, Daniel KRÁĽ a TL MARTINS. Finitely forcible graph limits are universal. Advances in Mathematics. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2018, roč. 340, December, s. 819-854. ISSN 0001-8708. doi:10.1016/j.aim.2018.10.019.
      Podrobněji: https://is.muni.cz/publication/1524557/cs
    2. Optimal-size clique transversals in chordal graphs
      COOPER, Jacob, Andrzej GRZESIK a Daniel KRÁĽ. Optimal-size clique transversals in chordal graphs. Journal of Graph Theory. Wiley, 2018, roč. 89, č. 4, s. 479-493. ISSN 0364-9024. doi:10.1002/jgt.22362.
      Podrobněji: https://is.muni.cz/publication/1554844/cs
    3. Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk
      KRÁĽ, Daniel, R THOMAS a Zdenek DVORAK. Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2018, roč. 132, s. 1-46. ISSN 0095-8956. doi:10.1016/j.jctb.2018.03.001.
      Podrobněji: https://is.muni.cz/publication/1688765/cs
    4. Walk entropy and walk-regularity
      KLOSTER, Kyle, BD SULLIVAN a Daniel KRÁĽ. Walk entropy and walk-regularity. Linear Algebra and its Applications. USA: Elsevier Science, 2018, roč. 546, s. 115-121. ISSN 0024-3795. doi:10.1016/j.laa.2018.02.009.
      Podrobněji: https://is.muni.cz/publication/1688768/cs
    5. Weak regularity and finitely forcible graph limits
      COOPER, Jacob, Tomáš KAISER, Daniel KRÁĽ a Jonathan NOEL. Weak regularity and finitely forcible graph limits. Transactions of the American Mathematical Society. American Mathematical Society, 2018, roč. 370, č. 6, s. 3833-3864. ISSN 0002-9947. doi:10.1090/tran/7066.
      Podrobněji: https://is.muni.cz/publication/1554857/cs

    2017

    1. COUNTING FLAGS IN TRIANGLE-FREE DIGRAPHS
      HLADKY, J, Daniel KRÁĽ a S NORIN. COUNTING FLAGS IN TRIANGLE-FREE DIGRAPHS. Combinatorica : an international journal of the János Bolyai Mathematical Society. Budapest: Mathematical Institute of the Hungarian Academy of Sciences, 2017, roč. 37, č. 1, s. 49-76. ISSN 0209-9683. doi:10.1007/s00493-015-2662-5.
      Podrobněji: https://is.muni.cz/publication/1688770/cs
    2. Densities in large permutations and parameter testing
      GLEBOV, R, C HOPPEN, T KLIMOSOVA, Y KOHAYAKAWA, Daniel KRÁĽ a H LIU. Densities in large permutations and parameter testing. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2017, roč. 60, s. 89-99. ISSN 0195-6698. doi:10.1016/j.ejc.2016.09.006.
      Podrobněji: https://is.muni.cz/publication/1688882/cs
    3. Densities in large permutations and parameter testing
      GLEBOV, R, C HOPPEN, T KLIMOSOVA, Y KOHAYAKAWA, Daniel KRÁĽ a H LIU. Densities in large permutations and parameter testing. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2017, roč. 60, s. 89-99. ISSN 0195-6698. doi:10.1016/j.ejc.2016.09.006.
      Podrobněji: https://is.muni.cz/publication/1688769/cs
    4. First order convergence of matroids
      KARDOS, F, Daniel KRÁĽ, A LIEBENAU a L MACH. First order convergence of matroids. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2017, roč. 59, s. 150-168. ISSN 0195-6698. doi:10.1016/j.ejc.2016.08.005.
      Podrobněji: https://is.muni.cz/publication/1688907/cs
    5. First order limits of sparse graphs: Plane trees and path-width
      GAJARSKÝ, Jakub, Petr HLINĚNÝ, Tomáš KAISER, Daniel KRÁĽ, Martin KUPEC, Jan OBDRŽÁLEK, Sebastian ORDYNIAK a Vojtěch TŮMA. First order limits of sparse graphs: Plane trees and path-width. Random Structures & Algorithms. Wiley, 2017, roč. 50, č. 4, s. 612-635. ISSN 1042-9832. doi:10.1002/rsa.20676.
      Podrobněji: https://is.muni.cz/publication/1372353/cs
    6. Graphic TSP in Cubic Graphs
      DVORAK, Z, Daniel KRÁĽ a B MOHAR. Graphic TSP in Cubic Graphs. 34TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2017). WADEM: SCHLOSS DAGSTUHL, LEIBNIZ CENTER INFORMATICS, 2017, roč. 66, 13 s. ISSN 1868-8969. doi:10.4230/LIPIcs.STACS.2017.27.
      Podrobněji: https://is.muni.cz/publication/1688906/cs
    7. Steinberg's Conjecture is false
      COHEN-ADDAD, V HEBDIGE, Daniel KRÁĽ, D LI a Salgado ZT. Steinberg's Conjecture is false. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2017, roč. 122, s. 452-456. ISSN 0095-8956. doi:10.1016/j.jctb.2016.07.006.
      Podrobněji: https://is.muni.cz/publication/1688905/cs

    2016

    1. A PROBLEM OF ERDOS AND SOS ON 3-GRAPHS
      GLEBOV, R, Daniel KRÁĽ a J VOLEC. A PROBLEM OF ERDOS AND SOS ON 3-GRAPHS. Israel Journal of Mathematics. JERUSALEM: HEBREW UNIV MAGNES PRESS, 2016, roč. 211, č. 1, s. 349-366. ISSN 0021-2172. doi:10.1007/s11856-015-1267-4.
      Podrobněji: https://is.muni.cz/publication/1688909/cs
    2. Packing six T-joins in plane graphs
      DVORAK, Z, K KAWARABAYASHI a Daniel KRÁĽ. Packing six T-joins in plane graphs. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2016, roč. 116, s. 287-305. ISSN 0095-8956. doi:10.1016/j.jctb.2015.09.002.
      Podrobněji: https://is.muni.cz/publication/1688912/cs
    3. THIRD CASE OF THE CYCLIC COLORING CONJECTURE
      HEBDIGE, M a Daniel KRÁĽ. THIRD CASE OF THE CYCLIC COLORING CONJECTURE. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2016, roč. 30, č. 1, s. 525-548. ISSN 0895-4801. doi:10.1137/15M1019490.
      Podrobněji: https://is.muni.cz/publication/1688911/cs
    4. Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle
      DVORAK, Z, Daniel KRÁĽ a R THOMAS. Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2016, roč. 120, s. 1-17. ISSN 0095-8956. doi:10.1016/j.jctb.2016.04.003.
      Podrobněji: https://is.muni.cz/publication/1688908/cs

    2015

    1. Finitely forcible graphons and permutons
      GLEBOV, R, A GRZESIK, T KLIMOSOVA a Daniel KRÁĽ. Finitely forcible graphons and permutons. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2015, roč. 110, s. 112-135. ISSN 0095-8956. doi:10.1016/j.jctb.2014.07.007.
      Podrobněji: https://is.muni.cz/publication/1688913/cs
    2. FO Model Checking of Interval Graphs
      GANIAN, Robert, Petr HLINĚNÝ, Daniel KRÁĽ, Jan OBDRŽÁLEK, Jarett SCHWARTZ a Jakub TESKA. FO Model Checking of Interval Graphs. Logical Methods in Computer Science. Německo: Logical Methods in Computer Science e.V., 2015, roč. 11, 4:11, s. 1-20. ISSN 1860-5974. doi:10.2168/LMCS-11(4:11)2015.
      Podrobněji: https://is.muni.cz/publication/1323000/cs

    2014

    1. Extensions of Fractional Precolorings Show Discontinuous Behavior
      HEUVEL, van den, Daniel KRÁĽ, M KUPEC, JS SERENI a J VOLEC. Extensions of Fractional Precolorings Show Discontinuous Behavior. Journal of Graph Theory. HOBOKEN: Wiley, 2014, roč. 77, č. 4, s. 299-329. ISSN 0364-9024. doi:10.1002/jgt.21787.
      Podrobněji: https://is.muni.cz/publication/1688914/cs
    2. The fractional chromatic number of triangle-free subcubic graphs
      FERGUSON, DG, T KAISER a Daniel KRÁĽ. The fractional chromatic number of triangle-free subcubic graphs. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2014, roč. 35, s. 184-220. ISSN 0195-6698. doi:10.1016/j.ejc.2013.06.006.
      Podrobněji: https://is.muni.cz/publication/1688919/cs
    3. The fractional chromatic number of triangle-free subcubic graphs
      FERGUSON, DG, T KAISER a Daniel KRÁĽ. The fractional chromatic number of triangle-free subcubic graphs. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2014, roč. 35, s. 184-220. ISSN 0195-6698. doi:10.1016/j.ejc.2013.06.006.
      Podrobněji: https://is.muni.cz/publication/1688916/cs

    2013

    1. A New Bound for the 2/3 Conjecture
      KRÁĽ, Daniel, CH LIU, JS SERENI, P WHALEN a ZB YILMA. A New Bound for the 2/3 Conjecture. COMBINATORICS PROBABILITY & COMPUTING. NEW YORK: CAMBRIDGE UNIV PRESS, 2013, roč. 22, č. 3, s. 384-393. ISSN 0963-5483. doi:10.1017/S0963548312000612.
      Podrobněji: https://is.muni.cz/publication/1688926/cs
    2. Monochromatic triangles in three-coloured graphs
      CUMMINGS, J, Daniel KRÁĽ, F PFENDER, K SPERFELD, A TREGLOWN a M YOUNG. Monochromatic triangles in three-coloured graphs. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2013, roč. 103, č. 4, s. 489-503. ISSN 0095-8956. doi:10.1016/j.jctb.2013.05.002.
      Podrobněji: https://is.muni.cz/publication/1688923/cs
    3. On the number of pentagons in triangle-free graphs
      HATAMI, H, J HLADKY, Daniel KRÁĽ, S NORINE a A RAZBOROV. On the number of pentagons in triangle-free graphs. Journal of Combinatorial Theory, Series A. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2013, roč. 120, č. 3, s. 722-732. ISSN 0097-3165. doi:10.1016/j.jcta.2012.12.008.
      Podrobněji: https://is.muni.cz/publication/1689622/cs
    4. On the removal lemma for linear systems over Abelian groups
      KRÁĽ, Daniel, O SERRA a L VENA. On the removal lemma for linear systems over Abelian groups. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2013, roč. 34, č. 2, s. 248-259. ISSN 0195-6698. doi:10.1016/j.ejc.2012.07.003.
      Podrobněji: https://is.muni.cz/publication/1689624/cs
    5. Packing directed cycles through a specified vertex set
      KAWARABAYASHI, K, Daniel KRÁĽ, M KRCAL a S KREUTZER. Packing directed cycles through a specified vertex set. PHILADELPHIA: SIAM, 2013, s. 365-377.
      Podrobněji: https://is.muni.cz/publication/1689625/cs
    6. Quasirandom permutations are characterized by 4-point densities
      KRÁĽ, Daniel a O PIKHURKO. Quasirandom permutations are characterized by 4-point densities. GEOMETRIC AND FUNCTIONAL ANALYSIS. BASEL: SPRINGER BASEL AG, 2013, roč. 23, č. 2, s. 570-579. ISSN 1016-443X. doi:10.1007/s00039-013-0216-9.
      Podrobněji: https://is.muni.cz/publication/1689623/cs
    7. Rank of divisors on tropical curves
      HLADKY, J, Daniel KRÁĽ a S NORINE. Rank of divisors on tropical curves. Journal of Combinatorial Theory, Series A. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2013, roč. 120, č. 7, s. 1521-1538. ISSN 0097-3165. doi:10.1016/j.jcta.2013.05.002.
      Podrobněji: https://is.muni.cz/publication/1688922/cs
    8. Testing First-Order Properties for Subclasses of Sparse Graphs
      DVORAK, Z, Daniel KRÁĽ a R THOMAS. Testing First-Order Properties for Subclasses of Sparse Graphs. Journal of the ACM. NEW YORK: ASSOC COMPUTING MACHINERY, 2013, roč. 60, č. 5, 24 s. ISSN 0004-5411. doi:10.1145/2499483.
      Podrobněji: https://is.muni.cz/publication/1688920/cs

    2012

    1. A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points
      KRÁĽ, Daniel, L MACH a JS SERENI. A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points. DISCRETE & COMPUTATIONAL GEOMETRY. NEW YORK: SPRINGER, 2012, roč. 48, č. 2, s. 487-498. ISSN 0179-5376. doi:10.1007/s00454-012-9419-3.
      Podrobněji: https://is.muni.cz/publication/1689627/cs
    2. A removal lemma for systems of linear equations over finite fields
      KRÁĽ, Daniel, O SERRA a L VENA. A removal lemma for systems of linear equations over finite fields. Israel Journal of Mathematics. JERUSALEM: HEBREW UNIV MAGNES PRESS, 2012, roč. 187, č. 1, s. 193-207. ISSN 0021-2172. doi:10.1007/s11856-011-0080-y.
      Podrobněji: https://is.muni.cz/publication/1689635/cs
    3. A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
      ESPERET, L, F KARDOS a Daniel KRÁĽ. A superlinear bound on the number of perfect matchings in cubic bridgeless graphs. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2012, roč. 33, č. 5, s. 767-798. ISSN 0195-6698. doi:10.1016/j.ejc.2011.09.027.
      Podrobněji: https://is.muni.cz/publication/1689629/cs
    4. Classes of graphs with small rank decompositions are chi-bounded
      DVORAK, Z a Daniel KRÁĽ. Classes of graphs with small rank decompositions are chi-bounded. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2012, roč. 33, č. 4, s. 679-683. ISSN 0195-6698. doi:10.1016/j.ejc.2011.12.005.
      Podrobněji: https://is.muni.cz/publication/1689631/cs
    5. Coloring Eulerian Triangulations of the Klein Bottle
      KRÁĽ, Daniel, B MOHAR, A NAKAMOTO, O PANGRAC a Y SUZUKI. Coloring Eulerian Triangulations of the Klein Bottle. Graphs and Combinatorics. TOKYO: Springer, 2012, roč. 28, č. 4, s. 499-530. ISSN 0911-0119. doi:10.1007/s00373-011-1063-9.
      Podrobněji: https://is.muni.cz/publication/1689630/cs
    6. Cyclic colorings of plane graphs with independent faces
      AZARIJA, J, R ERMAN, Daniel KRÁĽ, M KRNC a L STACHO. Cyclic colorings of plane graphs with independent faces. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2012, roč. 33, č. 3, s. 294-301. ISSN 0195-6698. doi:10.1016/j.ejc.2011.09.011.
      Podrobněji: https://is.muni.cz/publication/1689632/cs
    7. Deciding First Order Properties of Matroids
      GAVENCIAK, T, Daniel KRÁĽ a SI OUM. Deciding First Order Properties of Matroids. AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012, PT II. BERLIN: SPRINGER-VERLAG BERLIN, 2012, roč. 7392, s. 239-250. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689639/cs
    8. Decomposition width of matroids
      KRÁĽ, Daniel. Decomposition width of matroids. Discrete Applied Mathematics. AMSTERDAM: Elsevier B.V., 2012, roč. 160, č. 6, s. 913-923. ISSN 0166-218X. doi:10.1016/j.dam.2011.03.016.
      Podrobněji: https://is.muni.cz/publication/1689633/cs
    9. Domination number of cubic graphs with large girth
      KRÁĽ, Daniel, P SKODA a J VOLEC. Domination number of cubic graphs with large girth. Journal of Graph Theory. MALDEN: Wiley, 2012, roč. 69, č. 2, s. 131-142. ISSN 0364-9024. doi:10.1002/jgt.20568.
      Podrobněji: https://is.muni.cz/publication/1689634/cs
    10. EXTENDING FRACTIONAL PRECOLORINGS
      KRÁĽ, Daniel, M KRNC, M KUPEC, B LUZAR a J VOLEC. EXTENDING FRACTIONAL PRECOLORINGS. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2012, roč. 26, č. 2, s. 647-660. ISSN 0895-4801. doi:10.1137/110828988.
      Podrobněji: https://is.muni.cz/publication/1689637/cs
    11. Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
      KARDOS, F, Daniel KRÁĽ a Volec J. Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs. RANDOM STRUCTURES & ALGORITHMS. HOBOKEN: WILEY, 2012, roč. 41, č. 4, s. 506-520. ISSN 1042-9832. doi:10.1002/rsa.20471.
      Podrobněji: https://is.muni.cz/publication/1689626/cs
    12. MIN-MAX RELATIONS FOR ODD CYCLES IN PLANAR GRAPHS
      KRÁĽ, Daniel, JS SERENI a L STACHO. MIN-MAX RELATIONS FOR ODD CYCLES IN PLANAR GRAPHS. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2012, roč. 26, č. 3, s. 884-895. ISSN 0895-4801. doi:10.1137/110845835.
      Podrobněji: https://is.muni.cz/publication/1689638/cs
    13. Non-Three-Colourable Common Graphs Exist
      HATAMI, H, J HLADKY, Daniel KRÁĽ, S NORINE a A RAZBOROV. Non-Three-Colourable Common Graphs Exist. COMBINATORICS PROBABILITY & COMPUTING. NEW YORK: CAMBRIDGE UNIV PRESS, 2012, roč. 21, č. 5, s. 734-742. ISSN 0963-5483. doi:10.1017/S0963548312000107.
      Podrobněji: https://is.muni.cz/publication/1689628/cs

    2011

    1. Exponentially many perfect matchings in cubic graphs
      ESPERET, L, F KARDOS, King AD, Daniel KRÁĽ a S NORINE. Exponentially many perfect matchings in cubic graphs. Advances in Mathematics. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2011, roč. 227, č. 4, s. 1646-1664. ISSN 0001-8708. doi:10.1016/j.aim.2011.03.015.
      Podrobněji: https://is.muni.cz/publication/1689641/cs
    2. FRACTIONAL COLORINGS OF CUBIC GRAPHS WITH LARGE GIRTH
      KARDOS, F, Daniel KRÁĽ a Volec J. FRACTIONAL COLORINGS OF CUBIC GRAPHS WITH LARGE GIRTH. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2011, roč. 25, č. 3, s. 1454-1476. ISSN 0895-4801. doi:10.1137/100812082.
      Podrobněji: https://is.muni.cz/publication/1689645/cs
    3. Fractional total colourings of graphs of high girth
      KAISER, T, A KING a Daniel KRÁĽ. Fractional total colourings of graphs of high girth. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2011, roč. 101, č. 6, s. 383-402. ISSN 0095-8956. doi:10.1016/j.jctb.2010.12.005.
      Podrobněji: https://is.muni.cz/publication/1689640/cs
    4. LIMIT BEHAVIOR OF LOCALLY CONSISTENT CONSTRAINT SATISFACTION PROBLEMS
      BODIRSKY, M a Daniel KRÁĽ. LIMIT BEHAVIOR OF LOCALLY CONSISTENT CONSTRAINT SATISFACTION PROBLEMS. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2011, roč. 25, č. 2, s. 916-933. ISSN 0895-4801. doi:10.1137/060667591.
      Podrobněji: https://is.muni.cz/publication/1689644/cs
    5. Triangles in arrangements of points and lines in the plane
      KLAVIK, P, Daniel KRÁĽ a L MACH. Triangles in arrangements of points and lines in the plane. Journal of Combinatorial Theory, Series A. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2011, roč. 118, č. 3, s. 1140-1142. ISSN 0097-3165. doi:10.1016/j.jcta.2010.11.002.
      Podrobněji: https://is.muni.cz/publication/1689643/cs

    2010

    1. A note on antisymmetric flows in graphs
      DVORAK, Z, T KAISER, Daniel KRÁĽ a JS SERENI. A note on antisymmetric flows in graphs. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2010, roč. 31, č. 1, s. 320-324. ISSN 0195-6698. doi:10.1016/j.ejc.2009.05.005.
      Podrobněji: https://is.muni.cz/publication/1689678/cs
    2. Algorithms for Classes of Graphs with Bounded Expansion
      DVORAK, Z a Daniel KRÁĽ. Algorithms for Classes of Graphs with Bounded Expansion. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE. BERLIN: SPRINGER-VERLAG BERLIN, 2010, roč. 5911, s. 17-32. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689681/cs
    3. An improved linear bound on the number of perfect matchings in cubic graphs
      ESPERET, L, Daniel KRÁĽ, P SKODA a R SKREKOVSKI. An improved linear bound on the number of perfect matchings in cubic graphs. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2010, roč. 31, č. 5, s. 1316-1334. ISSN 0195-6698. doi:10.1016/j.ejc.2009.11.008.
      Podrobněji: https://is.muni.cz/publication/1689650/cs
    4. Brooks' Theorem via the Alon-Tarsi Theorem
      HLADKY, J, Daniel KRÁĽ a U SCHAUZ. Brooks' Theorem via the Alon-Tarsi Theorem. Discrete Mathematics. AMSTERDAM: Elsevier B. V., 2010, roč. 310, č. 23, s. 3426-3428. ISSN 0012-365X. doi:10.1016/j.disc.2010.07.019.
      Podrobněji: https://is.muni.cz/publication/1689656/cs
    5. Circular edge-colorings of cubic graphs with girth six
      KRÁĽ, Daniel, E MACAJOVA, J MAZAK a JS SERENI. Circular edge-colorings of cubic graphs with girth six. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2010, roč. 100, č. 4, s. 351-358. ISSN 0095-8956. doi:10.1016/j.jctb.2009.10.003.
      Podrobněji: https://is.muni.cz/publication/1689647/cs
    6. Coloring Plane Graphs with Independent Crossings
      KRÁĽ, Daniel a L STACHO. Coloring Plane Graphs with Independent Crossings. Journal of Graph Theory. HOBOKEN: Wiley, 2010, roč. 64, č. 3, s. 184-205. ISSN 0364-9024. doi:10.1002/jgt.20448.
      Podrobněji: https://is.muni.cz/publication/1689651/cs
    7. Deciding first-order properties for sparse graphs
      KRÁĽ, Daniel, Daniel KRÁĽ a R THOMAS. Deciding first-order properties for sparse graphs. 2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. LOS ALAMITOS: IEEE COMPUTER SOC, 2010, s. 133-142. ISSN 0272-5428. doi:10.1109/FOCS.2010.20.
      Podrobněji: https://is.muni.cz/publication/1689684/cs
    8. EQUIPARTITE POLYTOPES
      GRUNBAUM, B, T KAISER, Daniel KRÁĽ a M ROSENFELD. EQUIPARTITE POLYTOPES. Israel Journal of Mathematics. JERUSALEM: HEBREW UNIV MAGNES PRESS, 2010, roč. 179, č. 1, s. 235-252. ISSN 0021-2172. doi:10.1007/s11856-010-0080-3.
      Podrobněji: https://is.muni.cz/publication/1689648/cs
    9. Facial colorings using Hall's Theorem
      HAVET, F, Daniel KRÁĽ, JS SERENI a R SKREKOVSKI. Facial colorings using Hall's Theorem. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2010, roč. 31, č. 3, s. 1001-1019. ISSN 0195-6698. doi:10.1016/j.ejc.2009.10.003.
      Podrobněji: https://is.muni.cz/publication/1689652/cs
    10. Graphs with bounded tree-width and large odd-girth are almost bipartite
      KOSTOCHKA, AV, Daniel KRÁĽ, JS SERENI a M STIEBITZ. Graphs with bounded tree-width and large odd-girth are almost bipartite. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2010, roč. 100, č. 6, s. 554-559. ISSN 0095-8956. doi:10.1016/j.jctb.2010.04.004.
      Podrobněji: https://is.muni.cz/publication/1689649/cs
    11. Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs
      KRÁĽ, Daniel, E MACAJOVA, A POR a JS SERENI. Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs. CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES. OTTAWA: CANADIAN MATHEMATICAL SOCIETY, 2010, roč. 62, č. 2, s. 355-381. ISSN 0008-414X. doi:10.4153/CJM-2010-021-9.
      Podrobněji: https://is.muni.cz/publication/1689654/cs
    12. Markov bases of binary graph models of K-4-minor free graphs
      KRÁĽ, Daniel, S NORINE a O PANGRAC. Markov bases of binary graph models of K-4-minor free graphs. Journal of Combinatorial Theory, Series A. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2010, roč. 117, č. 6, s. 759-765. ISSN 0097-3165. doi:10.1016/j.jcta.2009.07.007.
      Podrobněji: https://is.muni.cz/publication/1689657/cs
    13. Non-Rainbow Colorings of 3-, 4-and 5-Connected Plane Graphs
      DVORAK, Z, Daniel KRÁĽ a R SKREKOVSKI. Non-Rainbow Colorings of 3-, 4-and 5-Connected Plane Graphs. Journal of Graph Theory. HOBOKEN: Wiley, 2010, roč. 63, č. 2, s. 129-145. ISSN 0364-9024. doi:10.1002/jgt.20414.
      Podrobněji: https://is.muni.cz/publication/1689676/cs
    14. Pattern Hypergraphs
      DVORAK, Z, J KARA, Daniel KRÁĽ a O PANGRAC. Pattern Hypergraphs. Electronic Journal of Combinatorics. Newark, USA: ELECTRONIC JOURNAL OF COMBINATORICS, 2010, roč. 17, č. 1, 20 s. ISSN 1077-8926.
      Podrobněji: https://is.muni.cz/publication/1689677/cs
    15. SHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE
      KAISER, T Kral, Daniel KRÁĽ, P NEJEDLY a Lidicky B SAMAL R. SHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2010, roč. 24, č. 1, s. 330-355. ISSN 0895-4801. doi:10.1137/080717468.
      Podrobněji: https://is.muni.cz/publication/1689680/cs
    16. THE LAST FRACTION OF A FRACTIONAL CONJECTURE
      KARDOS, F, Daniel KRÁĽ a JS SERENI. THE LAST FRACTION OF A FRACTIONAL CONJECTURE. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2010, roč. 24, č. 2, s. 699-707. ISSN 0895-4801. doi:10.1137/090779097.
      Podrobněji: https://is.muni.cz/publication/1689682/cs
    17. Toughness threshold for the existence of 2-walks in K-4-minor-free graphs
      DVORAK, Z, Daniel KRÁĽ a J TESKA. Toughness threshold for the existence of 2-walks in K-4-minor-free graphs. Discrete Mathematics. AMSTERDAM: Elsevier B. V., 2010, roč. 310, č. 3, s. 642-651. ISSN 0012-365X. doi:10.1016/j.disc.2009.05.016.
      Podrobněji: https://is.muni.cz/publication/1689653/cs

    2009

    1. A combinatorial proof of the Removal Lemma for Groups
      KRÁĽ, Daniel, O SERRA a L VENA. A combinatorial proof of the Removal Lemma for Groups. Journal of Combinatorial Theory, Series A. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2009, roč. 116, č. 4, s. 971-978. ISSN 0097-3165. doi:10.1016/j.jcta.2008.12.003.
      Podrobněji: https://is.muni.cz/publication/1689692/cs
    2. A NEW LOWER BOUND ON THE NUMBER OF PERFECT MATCHINGS IN CUBIC GRAPHS
      KRÁĽ, Daniel, JS SERENI a M STIEBITZ. A NEW LOWER BOUND ON THE NUMBER OF PERFECT MATCHINGS IN CUBIC GRAPHS. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2009, roč. 23, č. 3, s. 1465-1483. ISSN 0895-4801. doi:10.1137/080723843.
      Podrobněji: https://is.muni.cz/publication/1689699/cs
    3. A note on edge-colourings avoiding rainbow K-4 and monochromatic K-m
      JUNGIC, V, TS KAISER a Daniel KRÁĽ. A note on edge-colourings avoiding rainbow K-4 and monochromatic K-m. Electronic Journal of Combinatorics. Newark, USA: ELECTRONIC JOURNAL OF COMBINATORICS, 2009, roč. 16, č. 1, 9 s. ISSN 1077-8926.
      Podrobněji: https://is.muni.cz/publication/1689690/cs
    4. Coloring triangle-free graphs on surfaces
      DVORAK, Z, Daniel KRÁĽ a R THOMAS. Coloring triangle-free graphs on surfaces. PHILADELPHIA: SIAM, 2009, s. "120"-"+", 2 s.
      Podrobněji: https://is.muni.cz/publication/1689700/cs
    5. Distance constrained labelings of K-4-minor free graphs
      KRÁĽ, Daniel a P NEJEDLY. Distance constrained labelings of K-4-minor free graphs. Discrete Mathematics. AMSTERDAM: Elsevier B. V., 2009, roč. 309, č. 18, s. 5745-5756. ISSN 0012-365X. doi:10.1016/j.disc.2008.05.022.
      Podrobněji: https://is.muni.cz/publication/1689685/cs
    6. Distance constrained labelings of planar graphs with no short cycles
      DVORAK, Z, Daniel KRÁĽ, P NEJEDLY a R SKREKOVSKI. Distance constrained labelings of planar graphs with no short cycles. Discrete Applied Mathematics. AMSTERDAM: Elsevier B.V., 2009, roč. 157, č. 12, s. 2634-2645. ISSN 0166-218X. doi:10.1016/j.dam.2008.08.013.
      Podrobněji: https://is.muni.cz/publication/1689687/cs
    7. Fullerene graphs have exponentially many perfect matchings
      KARDOS, F, Daniel KRÁĽ, J MISKUF a JS SERENI. Fullerene graphs have exponentially many perfect matchings. JOURNAL OF MATHEMATICAL CHEMISTRY. NEW YORK: SPRINGER, 2009, roč. 46, č. 2, s. 443-447. ISSN 0259-9791. doi:10.1007/s10910-008-9471-7.
      Podrobněji: https://is.muni.cz/publication/1689686/cs
    8. Graph labellings with variable weights, a survey
      GRIGGS, JR a Daniel KRÁĽ. Graph labellings with variable weights, a survey. Discrete Applied Mathematics. AMSTERDAM: Elsevier B.V., 2009, roč. 157, č. 12, s. 2646-2658. ISSN 0166-218X. doi:10.1016/j.dam.2008.08.024.
      Podrobněji: https://is.muni.cz/publication/1689688/cs
    9. Chromatic number for a generalization of Cartesian product graphs
      KRÁĽ, Daniel a DB WEST. Chromatic number for a generalization of Cartesian product graphs. Electronic Journal of Combinatorics. Newark, USA: ELECTRONIC JOURNAL OF COMBINATORICS, 2009, roč. 16, č. 1, 9 s. ISSN 1077-8926.
      Podrobněji: https://is.muni.cz/publication/1689689/cs
    10. Long cycles in fullerene graphs
      KRÁĽ, Daniel, O PANGRAC, JS SERENI a R SKREKOVSKI. Long cycles in fullerene graphs. JOURNAL OF MATHEMATICAL CHEMISTRY. NEW YORK: SPRINGER, 2009, roč. 45, č. 4, s. 1021-1031. ISSN 0259-9791. doi:10.1007/s10910-008-9390-7.
      Podrobněji: https://is.muni.cz/publication/1689693/cs
    11. MATCHINGS AND NONRAINBOW COLORINGS
      DVORAK, Z, S JENDROL, Daniel KRÁĽ a G PAP. MATCHINGS AND NONRAINBOW COLORINGS. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2009, roč. 23, č. 1, s. 344-348. ISSN 0895-4801. doi:10.1137/060675927.
      Podrobněji: https://is.muni.cz/publication/1689695/cs
    12. OPTIMAL REAL NUMBER GRAPH LABELLINGS OF A SUBFAMILY OF KNESER GRAPHS
      ERMAN, R Jurecic S, STOPAR N a Daniel KRÁĽ. OPTIMAL REAL NUMBER GRAPH LABELLINGS OF A SUBFAMILY OF KNESER GRAPHS. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2009, roč. 23, č. 3, s. 1372-1381. ISSN 0895-4801. doi:10.1137/060672923.
      Podrobněji: https://is.muni.cz/publication/1689698/cs
    13. Polynomial-Size Binary Decision Diagrams for the Exactly Half-d-Hyperclique Problem Reading Each Input Bit Twice
      KRÁĽ, Daniel. Polynomial-Size Binary Decision Diagrams for the Exactly Half-d-Hyperclique Problem Reading Each Input Bit Twice. Theory of Computing Systems. New York: Springer, 2009, roč. 45, č. 1, s. 27-42. ISSN 1432-4350. doi:10.1007/s00224-007-9067-9.
      Podrobněji: https://is.muni.cz/publication/1689691/cs
    14. Projective, affine, and abelian colorings of cubic graphs
      KRÁĽ, Daniel, E MACAJOVA, O PANGRAC, A RASPAUD, JS SERENI a M SKOVIERA. Projective, affine, and abelian colorings of cubic graphs. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2009, roč. 30, č. 1, s. 53-69. ISSN 0195-6698. doi:10.1016/j.ejc.2007.11.029.
      Podrobněji: https://is.muni.cz/publication/1689697/cs
    15. 6-CRITICAL GRAPHS ON THE KLEIN BOTTLE
      KAWARABAYASHI, KI, Daniel KRÁĽ, J KYNCL a B LIDICKY. 6-CRITICAL GRAPHS ON THE KLEIN BOTTLE. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2009, roč. 23, č. 1, s. 372-383. ISSN 0895-4801. doi:10.1137/070706835.
      Podrobněji: https://is.muni.cz/publication/1689696/cs

    2008

    1. BOUNDS FOR THE REAL NUMBER GRAPH LABELLINGS AND APPLICATION TO LABELLINGS OF THE TRIANGULAR LATTICE
      KRÁĽ, Daniel a P SKODA. BOUNDS FOR THE REAL NUMBER GRAPH LABELLINGS AND APPLICATION TO LABELLINGS OF THE TRIANGULAR LATTICE. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2008, roč. 22, č. 4, s. 1559-1569. ISSN 0895-4801. doi:10.1137/07068552X.
      Podrobněji: https://is.muni.cz/publication/1689717/cs
    2. Coloring even-faced graphs in the torus and the Klein bottle
      KRÁĽ, Daniel a R THOMAS. Coloring even-faced graphs in the torus and the Klein bottle. Combinatorica : an international journal of the János Bolyai Mathematical Society. Budapest: Mathematical Institute of the Hungarian Academy of Sciences, 2008, roč. 28, č. 3, s. 325-341. ISSN 0209-9683. doi:10.1007/s00493-008-2315-z.
      Podrobněji: https://is.muni.cz/publication/1689715/cs
    3. Coloring of triangle-free graphs on the double torus
      KRÁĽ, Daniel a M STEHLIK. Coloring of triangle-free graphs on the double torus. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2008, roč. 22, č. 2, s. 541-553. ISSN 0895-4801. doi:10.1137/07067920X.
      Podrobněji: https://is.muni.cz/publication/1689714/cs
    4. Coloring squares of planar graphs with girth six
      DVORAK, Z, Daniel KRÁĽ, P NEJEDLY a R SKREKOVSKI. Coloring squares of planar graphs with girth six. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2008, roč. 29, č. 4, s. 838-849. ISSN 0195-6698. doi:10.1016/j.ejc.2007.11.005.
      Podrobněji: https://is.muni.cz/publication/1689712/cs
    5. Equipartite graphs
      GRUNBAUM, B, T KAISER, Daniel KRÁĽ a M ROSENFELD. Equipartite graphs. Israel Journal of Mathematics. JERUSALEM: HEBREW UNIV MAGNES PRESS, 2008, roč. 168, č. 1, s. 431-444. ISSN 0021-2172. doi:10.1007/s11856-008-1071-5.
      Podrobněji: https://is.muni.cz/publication/1689716/cs
    6. Hamiltonian threshold for strong products of graphs
      KRÁĽ, Daniel a L STACHO. Hamiltonian threshold for strong products of graphs. Journal of Graph Theory. HOBOKEN: Wiley, 2008, roč. 58, č. 4, s. 314-328. ISSN 0364-9024. doi:10.1002/jgt.20314.
      Podrobněji: https://is.muni.cz/publication/1689711/cs
    7. List Colorings with Measurable Sets
      HLADKY, J, Daniel KRÁĽ, JS SERENI a M STIEBITZ. List Colorings with Measurable Sets. Journal of Graph Theory. HOBOKEN: Wiley, 2008, roč. 59, č. 3, s. 229-238. ISSN 0364-9024. doi:10.1002/jgt.20335.
      Podrobněji: https://is.muni.cz/publication/1689701/cs
    8. Randomized strategies for the plurality problem
      KRÁĽ, Daniel, J SGALL a T TICHY. Randomized strategies for the plurality problem. Discrete Applied Mathematics. AMSTERDAM: Elsevier B.V., 2008, roč. 156, č. 17, s. 3305-3311. ISSN 0166-218X. doi:10.1016/j.dam.2008.05.014.
      Podrobněji: https://is.muni.cz/publication/1689702/cs

    2007

    1. Closure for the property of having a Hamiltonian prism
      KRÁĽ, Daniel a L STACHOL. Closure for the property of having a Hamiltonian prism. Journal of Graph Theory. HOBOKEN: Wiley, 2007, roč. 54, č. 3, s. 209-220. ISSN 0364-9024. doi:10.1002/jgt.20203.
      Podrobněji: https://is.muni.cz/publication/1689725/cs
    2. Coloring triangle-free graphs on surfaces
      DVORAK, Z, Daniel KRÁĽ a R THOMAS. Coloring triangle-free graphs on surfaces. ALGORITHMS AND COMPUTATION. BERLIN: SPRINGER-VERLAG BERLIN, 2007, roč. 4835, s. "2"-"+", 2 s. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689737/cs
    3. Computing representations of matroids of bounded branch-width
      KRÁĽ, Daniel. Computing representations of matroids of bounded branch-width. Stacs 2007, Proceedings. BERLIN: SPRINGER-VERLAG BERLIN, 2007, roč. 4393, s. 224-235. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689728/cs
    4. Cyclic, diagonal and facial colorings - a missing case
      KRÁĽ, Daniel, T MADARAS a R SKREKOVSKI. Cyclic, diagonal and facial colorings - a missing case. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD, 2007, roč. 28, č. 6, s. 1637-1639. ISSN 0195-6698. doi:10.1016/j.ejc.2006.07.005.
      Podrobněji: https://is.muni.cz/publication/1689723/cs
    5. Hamilton cycles in prisms
      KAISER, T, Z RYJACEK, Daniel KRÁĽ, M ROSENFELD a HJ VOSS. Hamilton cycles in prisms. Journal of Graph Theory. HOBOKEN: Wiley, 2007, roč. 56, č. 4, s. 249-269. ISSN 0364-9024. doi:10.1002/jgt.20250.
      Podrobněji: https://is.muni.cz/publication/1689718/cs
    6. Labeling planar graphs with a condition at distance two
      BELLA, P, Daniel KRÁĽ, B MOHAR a K QUITTNEROVA. Labeling planar graphs with a condition at distance two. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2007, roč. 28, č. 8, s. 2201-2239. ISSN 0195-6698. doi:10.1016/j.ejc.2007.04.019.
      Podrobněji: https://is.muni.cz/publication/1689719/cs
    7. Labelings of graphs with fixed and variable edge-weights
      BABILON, R, V JELINEK, Daniel KRÁĽ a P VALTR. Labelings of graphs with fixed and variable edge-weights. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2007, roč. 21, č. 3, s. 688-706. ISSN 0895-4801. doi:10.1137/040619545.
      Podrobněji: https://is.muni.cz/publication/1689736/cs
    8. Mixed hypergraphs and other coloring problems
      KRÁĽ, Daniel. Mixed hypergraphs and other coloring problems. Discrete Mathematics. AMSTERDAM: Elsevier B. V., 2007, roč. 307, 7-8, s. 923-938. ISSN 0012-365X. doi:10.1016/j.disc.2005.11.050.
      Podrobněji: https://is.muni.cz/publication/1689724/cs
    9. Probabilistic strategies for the partition and plurality problems
      DVORAK, Z, V JELINEK, Daniel KRÁĽ, J KYNCL a M SAKS. Probabilistic strategies for the partition and plurality problems. RANDOM STRUCTURES & ALGORITHMS. HOBOKEN: WILEY, 2007, roč. 30, 1-2, s. 63-77. ISSN 1042-9832. doi:10.1002/rsa.20148.
      Podrobněji: https://is.muni.cz/publication/1689727/cs
    10. The circular chromatic index of graphs of high girth
      KAISER, T, Daniel KRÁĽ, R SKREKOVSKI a XD ZHU. The circular chromatic index of graphs of high girth. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2007, roč. 97, č. 1, s. 1-13. ISSN 0095-8956. doi:10.1016/j.jctb.2006.03.002.
      Podrobněji: https://is.muni.cz/publication/1689726/cs
    11. Tough spiders
      KAISER, T, Daniel KRÁĽ a L STACHO. Tough spiders. Journal of Graph Theory. HOBOKEN: Wiley, 2007, roč. 56, č. 1, s. 23-40. ISSN 0364-9024. doi:10.1002/jgt.20244.
      Podrobněji: https://is.muni.cz/publication/1689722/cs

    2006

    1. Coloring mixed hypertrees
      KRÁĽ, Daniel, J KRATOCHVIL, A PROSKUROWSKI a HH VOSS. Coloring mixed hypertrees. Discrete Applied Mathematics. AMSTERDAM: Elsevier B.V., 2006, roč. 154, č. 4, s. 660-672. ISSN 0166-218X. doi:10.1016/j.dam.2005.05.019.
      Podrobněji: https://is.muni.cz/publication/1689742/cs
    2. Colorings of plane graphs with no rainbow faces
      JUNGIC, V, Daniel KRÁĽ a R SKREKOVSKI. Colorings of plane graphs with no rainbow faces. Combinatorica : an international journal of the János Bolyai Mathematical Society. Budapest: Mathematical Institute of the Hungarian Academy of Sciences, 2006, roč. 26, č. 2, s. 169-182. ISSN 0209-9683. doi:10.1007/s00493-006-0012-3.
      Podrobněji: https://is.muni.cz/publication/1689744/cs
    3. Construction of large graphs with no optimal surjective L(2,1)-labelings
      KRÁĽ, Daniel, R SKREKOVSKI a M TANCER. Construction of large graphs with no optimal surjective L(2,1)-labelings. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2006, roč. 20, č. 2, s. 536-543. ISSN 0895-4801. doi:10.1137/050623061.
      Podrobněji: https://is.muni.cz/publication/1689745/cs
    4. Eulerian colorings and the bipartizing matchings conjecture of Fleischner
      DVORAK, Z, T KAISER a Daniel KRÁĽ. Eulerian colorings and the bipartizing matchings conjecture of Fleischner. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2006, roč. 27, č. 7, s. 1088-1101. ISSN 0195-6698. doi:10.1016/j.ejc.2006.06.002.
      Podrobněji: https://is.muni.cz/publication/1689739/cs
    5. Extending partial 5-colorings and 6-colorings in planar graphs
      KRÁĽ, Daniel. Extending partial 5-colorings and 6-colorings in planar graphs. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2006, roč. 96, č. 1, s. 100-110. ISSN 0095-8956. doi:10.1016/j.jctb.2005.06.006.
      Podrobněji: https://is.muni.cz/publication/1689743/cs
    6. Free binary decision diagrams for the computation of EAR(n)
      KARA, J a Daniel KRÁĽ. Free binary decision diagrams for the computation of EAR(n). COMPUTATIONAL COMPLEXITY. BASEL: BIRKHAUSER VERLAG AG, 2006, roč. 15, č. 1, s. 40-61. ISSN 1016-3328. doi:10.1007/s00037-006-0206-5.
      Podrobněji: https://is.muni.cz/publication/1689746/cs
    7. List coloring of Cartesian products of graphs
      BOROWIECKI, M, S JENDROL, Daniel KRÁĽ a J MISKUF. List coloring of Cartesian products of graphs. Discrete Mathematics. AMSTERDAM: Elsevier B. V., 2006, roč. 306, č. 16, s. 1955-1958. ISSN 0012-365X. doi:10.1016/j.disc.2006.03.062.
      Podrobněji: https://is.muni.cz/publication/1689740/cs
    8. The circular chromatic index of flower snarks
      GHEBLEH, M, Daniel KRÁĽ, S NORINE a R THOMAS. The circular chromatic index of flower snarks. Electronic Journal of Combinatorics. Newark, USA: ELECTRONIC JOURNAL OF COMBINATORICS, 2006, roč. 13, č. 1, 7 s. ISSN 1077-8926.
      Podrobněji: https://is.muni.cz/publication/1689738/cs
    9. The channel assignment problem with variable weights
      KRÁĽ, Daniel. The channel assignment problem with variable weights. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2006, roč. 20, č. 3, s. 690-704. ISSN 0895-4801. doi:10.1137/040619636.
      Podrobněji: https://is.muni.cz/publication/1689747/cs
    10. The last excluded case of Dirac's Map-Color Theorem for choosability
      KRÁĽ, Daniel a R SKREKOVSKI. The last excluded case of Dirac's Map-Color Theorem for choosability. Journal of Graph Theory. HOBOKEN: Wiley, 2006, roč. 51, č. 4, s. 319-354. ISSN 0364-9024. doi:10.1002/jgt.20136.
      Podrobněji: https://is.muni.cz/publication/1689741/cs

    2005

    1. A note on group colorings
      KRÁĽ, Daniel, O PANGRAC a HJ VOSS. A note on group colorings. Journal of Graph Theory. HOBOKEN: Wiley, 2005, roč. 50, č. 2, s. 123-129. ISSN 0364-9024. doi:10.1002/jgt.20098.
      Podrobněji: https://is.muni.cz/publication/1689750/cs
    2. An asymptotically optimal linear-time algorithm for locally consistent constraint satisfaction problems
      KRÁĽ, Daniel a O PANGRAC. An asymptotically optimal linear-time algorithm for locally consistent constraint satisfaction problems. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2005, PROCEEDINGS. BERLIN: SPRINGER-VERLAG BERLIN, 2005, roč. 3618, s. 603-614. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689759/cs
    3. An exact algorithm for the channel ass assignment problem
      KRÁĽ, Daniel. An exact algorithm for the channel ass assignment problem. Discrete Applied Mathematics. AMSTERDAM: Elsevier B.V., 2005, roč. 145, č. 2, s. 326-331. ISSN 0166-218X. doi:10.1016/j.dam.2004.01.020.
      Podrobněji: https://is.muni.cz/publication/1689755/cs
    4. Brooks-type theorem for the generalized list T-coloring
      FIALA, J, Daniel KRÁĽ a R SKREKOVSKI. Brooks-type theorem for the generalized list T-coloring. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2005, roč. 19, č. 3, s. 588-609. ISSN 0895-4801. doi:10.1137/S0895480103437870.
      Podrobněji: https://is.muni.cz/publication/1689760/cs
    5. Coloring face hypergraphs on surfaces
      DVORAK, Z, Daniel KRÁĽ a R SKREKOVSKI. Coloring face hypergraphs on surfaces. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2005, roč. 26, č. 1, s. 95-110. ISSN 0195-6698. doi:10.1016/j.ejc.2004.01.003.
      Podrobněji: https://is.muni.cz/publication/1689756/cs
    6. Coloring graphs from lists with bounded size of their union
      KRÁĽ, Daniel a J SGALL. Coloring graphs from lists with bounded size of their union. Journal of Graph Theory. HOBOKEN: Wiley, 2005, roč. 49, č. 3, s. 177-186. ISSN 0364-9024. doi:10.1002/jgt.20073.
      Podrobněji: https://is.muni.cz/publication/1689751/cs
    7. Coloring powers of chordal graphs
      KRÁĽ, Daniel. Coloring powers of chordal graphs. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2005, roč. 18, č. 3, s. 451-461. ISSN 0895-4801. doi:10.1137/S0895480103424079.
      Podrobněji: https://is.muni.cz/publication/1689757/cs
    8. Cyclic, diagonal and facial colorings
      KRÁĽ, Daniel, T MADARAS a R SKREKOVSKI. Cyclic, diagonal and facial colorings. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD, 2005, roč. 26, 3-4, s. 473-490. ISSN 0195-6698. doi:10.1016/j.ejc.2004.01.016.
      Podrobněji: https://is.muni.cz/publication/1689752/cs
    9. Group coloring is Pi(P)(2)-complete
      KRÁĽ, Daniel. Group coloring is Pi(P)(2)-complete. Theoretical Computer Science. AMSTERDAM: North Holland, 2005, roč. 349, č. 1, s. 99-111. ISSN 0304-3975. doi:10.1016/j.tcs.2005.09.033.
      Podrobněji: https://is.muni.cz/publication/1689748/cs
    10. Hamilton cycles in strong products of graphs
      KRÁĽ, Daniel, J MAXOVA, R SAMAL a P PODBRDSKY. Hamilton cycles in strong products of graphs. Journal of Graph Theory. HOBOKEN: Wiley, 2005, roč. 48, č. 4, s. 299-321. ISSN 0364-9024. doi:10.1002/jgt.20058.
      Podrobněji: https://is.muni.cz/publication/1689753/cs
    11. Locally consistent constraint satisfaction problems
      DVORAK, Z, Daniel KRÁĽ a O PANGRAC. Locally consistent constraint satisfaction problems. Theoretical Computer Science. AMSTERDAM: North Holland, 2005, roč. 348, 2-3, s. 187-206. ISSN 0304-3975. doi:10.1016/j.tcs.2005.09.012.
      Podrobněji: https://is.muni.cz/publication/1689749/cs
    12. Locally consistent constraint satisfaction problems with binary constraints
      BODIRSKY, M a Daniel KRÁĽ. Locally consistent constraint satisfaction problems with binary constraints. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE. BERLIN: SPRINGER-VERLAG BERLIN, 2005, roč. 3787, s. 295-306. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689761/cs
    13. Three optimal algorithms for balls of three colors
      DVORAK, Z, V JELINEK, Daniel KRÁĽ, J KYNCL a M SAKS. Three optimal algorithms for balls of three colors. STACS 2005, PROCEEDINGS. BERLIN: SPRINGER-VERLAG BERLIN, 2005, roč. 3404, s. 206-217. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689758/cs
    14. Two Algorithms for General List Matrix Partitions
      FEDER, T, P HELL, Daniel KRÁĽ a J SGALL. Two Algorithms for General List Matrix Partitions. PHILADELPHIA: SIAM, 2005, s. 870-876.
      Podrobněji: https://is.muni.cz/publication/1689762/cs

    2004

    1. A revival of the girth conjecture
      KAISER, T, Daniel KRÁĽ a R SKREKOVSKI. A revival of the girth conjecture. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2004, roč. 92, č. 1, s. 41-53. ISSN 0095-8956. doi:10.1016/j.jctb.2004.04.003.
      Podrobněji: https://is.muni.cz/publication/1689857/cs
    2. An algorithm for cyclic edge connectivity of cubic graphs
      DVORAK, Z, J KARA, Daniel KRÁĽ a O PANGRAC. An algorithm for cyclic edge connectivity of cubic graphs. ALGORITHM THEORY- SWAT 2004. BERLIN: SPRINGER-VERLAG BERLIN, 2004, roč. 3111, s. 236-247. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689865/cs
    3. Borodin's conjecture on diagonal coloring is false
      KRÁĽ, Daniel a R SKEKOVSKI. Borodin's conjecture on diagonal coloring is false. European Journal of Combinatorics. LONDON: ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD, 2004, roč. 25, č. 6, s. 813-816. ISSN 0195-6698. doi:10.1016/j.ejc.2003.04.004.
      Podrobněji: https://is.muni.cz/publication/1689864/cs
    4. Edge-disjoint odd cycles in planar graphs
      KRÁĽ, Daniel a HJ VOSS. Edge-disjoint odd cycles in planar graphs. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2004, roč. 90, č. 1, s. 107-120. ISSN 0095-8956. doi:10.1016/S0095-8956(03)00078-9.
      Podrobněji: https://is.muni.cz/publication/1689861/cs
    5. Group coloring and list group coloring are Pi(P)(2)-complete
      KRÁĽ, Daniel a P NEJEDLY. Group coloring and list group coloring are Pi(P)(2)-complete. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS. BERLIN: SPRINGER-VERLAG BERLIN, 2004, roč. 3153, s. 274-286. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689866/cs
    6. Hajos' theorem for list coloring
      KRÁĽ, Daniel. Hajos' theorem for list coloring. Discrete Mathematics. AMSTERDAM: Elsevier B. V., 2004, roč. 287, 1-3, s. 161-163. ISSN 0012-365X. doi:10.1016/j.disc.2004.07.001.
      Podrobněji: https://is.muni.cz/publication/1689763/cs
    7. It is tough to be a plumber
      KRÁĽ, Daniel, V MAJERECH, J SGALL, T TICHY a G WOEGINGER. It is tough to be a plumber. Theoretical Computer Science. AMSTERDAM: North Holland, 2004, roč. 313, č. 3, s. 473-484. ISSN 0304-3975. doi:10.1016/j.tcs.2002.12.002.
      Podrobněji: https://is.muni.cz/publication/1689860/cs
    8. Locally consistent constraint satisfaction problems - (Extended abstract)
      DVORAK, Z, Daniel KRÁĽ a O PANGRAC. Locally consistent constraint satisfaction problems - (Extended abstract). AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS. BERLIN: SPRINGER-VERLAG BERLIN, 2004, roč. 3142, s. 469-480. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689867/cs
    9. Mixed hypercacti
      KRÁĽ, Daniel, J KRATOCHVIL a HJ VOSS. Mixed hypercacti. Discrete Mathematics. AMSTERDAM: Elsevier B. V., 2004, roč. 286, 1-2, s. 99-113. ISSN 0012-365X. doi:10.1016/j.disc.2003.11.051.
      Podrobněji: https://is.muni.cz/publication/1689764/cs
    10. On feasible sets of mixed hypergraphs
      KRÁĽ, Daniel. On feasible sets of mixed hypergraphs. Electronic Journal of Combinatorics. Newark, USA: ELECTRONIC JOURNAL OF COMBINATORICS, 2004, roč. 11, č. 1, 14 s. ISSN 1077-8926.
      Podrobněji: https://is.muni.cz/publication/1689858/cs
    11. Pancyclicity of strong products of graphs
      KRÁĽ, Daniel, J MAXOVA, P PODBRDSKY a R SAMAL. Pancyclicity of strong products of graphs. Graphs and Combinatorics. Tokyo: Springer Japan, 2004, roč. 20, č. 1, s. 91-104. ISSN 0911-0119. doi:10.1007/s00373-003-0545-9.
      Podrobněji: https://is.muni.cz/publication/1689862/cs

    2003

    1. A theorem about the channel assignment problem
      KRÁĽ, Daniel a R SKREKOVSKI. A theorem about the channel assignment problem. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2003, roč. 16, č. 3, s. 426-437. ISSN 0895-4801. doi:10.1137/S0895480101399449.
      Podrobněji: https://is.muni.cz/publication/1689870/cs
    2. Mimimum degree and the number of chords
      KARA, J a Daniel KRÁĽ. Mimimum degree and the number of chords. ARS COMBINATORIA. WINNIPEG: CHARLES BABBAGE RES CTR, 2003, roč. 68, s. 169-179. ISSN 0381-7032.
      Podrobněji: https://is.muni.cz/publication/1689868/cs
    3. Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs
      KRÁĽ, Daniel, J KRATOCHVIL a HJ VOSS. Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. Theoretical Computer Science. AMSTERDAM: North Holland, 2003, roč. 295, 1-3, s. 263-278. ISSN 0304-3975. doi:10.1016/S0304-3975(02)00408-5.
      Podrobněji: https://is.muni.cz/publication/1689869/cs

    2002

    1. Complexity of pattern coloring of cycle systems
      DVORAK, Z, J KARA, Daniel KRÁĽ a O PANGRAC. Complexity of pattern coloring of cycle systems. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE. BERLIN: SPRINGER-VERLAG BERLIN, 2002, roč. 2573, s. 164-175. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689873/cs
    2. On intersection graphs of segments with prescribed slopes
      CERNY, J, Daniel KRÁĽ, H NYKLOVA a O PANGRAC. On intersection graphs of segments with prescribed slopes. GRAPH DRAWING. BERLIN: SPRINGER-VERLAG BERLIN, 2002, roč. 2265, s. 261-271. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689871/cs
    3. Optimal free binary decision diagrams for computation of EAR(n)
      KARA, J a Daniel KRÁĽ. Optimal free binary decision diagrams for computation of EAR(n). MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002. BERLIN: SPRINGER-VERLAG BERLIN, 2002, roč. 2420, s. 411-422. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689872/cs

    2001

    1. Complexity note on mixed hypergraphs
      KRÁĽ, Daniel, J KRATOCHVIL a HJ VOSS. Complexity note on mixed hypergraphs. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001. BERLIN: SPRINGER-VERLAG BERLIN, 2001, roč. 2136, s. 474-485. ISSN 0302-9743.
      Podrobněji: https://is.muni.cz/publication/1689874/cs
Zobrazit podrobně
Zobrazeno: 8. 12. 2023 17:25