Preprinti IMFM

Avtor: Daniel Král'

1081: Louis Esperet, Daniel Král', Petr Škoda, Riste Škrekovski: An improved linear bound on the number of perfect matchings in cubic graphs, 47 (2009)

1062: Jernej Azarija, Rok Erman, Daniel Král', Matjaž Krnc, Ladislav Stacho: Cyclic colorings of plane graphs with independent faces, 46 (2008)

1050: Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Škrekovski: Facial colorings using Hall's Theorem, 46 (2008)

1040: Daniel Král', Ondřej Pangrác, Jean-Sébastien Sereni, Riste Škrekovski: Long cycles in fullerene graphs, 46 (2008)

1030: Zdeněk Dvořák, Daniel Král', Riste Škrekovski: Non-rainbow colorings of 3-, 4- and 5-connected plane graphs, 45 (2007)

1029: Daniel Král', Bojan Mohar, Atsuhiro Nakamoto, Ondřej Pangrác, Yusuke Suzuki: Coloring Eulerian trianulations of the Klein bottle, 45 (2007)

1020: Rok Erman, Suzana Jurečič, Daniel Král', Kris Stopar, Nik Stopar: Optimal real number graph labelings of a subfamily of Kneser graphs, 44 (2006)

997: Peter Bella, Daniel Král', Bojan Mohar, Katarína Quittnerová: Labeling planar graphs with a condition at distance two, 43 (2005)

976: Zdeněk Dvořák, Daniel Král', Pavel Nejedlý, Riste Škrekovski: Coloring squares of planar graphs with no short cycles, 43 (2005)

958: Daniel Král', Riste Škrekovski, Martin Tancer: Construction of large graphs with no optimal surjective L(2,1)-labelings, 43 (2005)

937: Tomáš Kaiser, Daniel Král', Riste Škrekovski, Xuding Zhu: The circular chromatic index of graphs of high girth, 42 (2004)

913: Daniel Král', Riste Škrekovski: The last excluded case of Dirac's map-color theorem for choosability, 42 (2004)

902: Jiří Fiala, Daniel Král', Riste Škrekovski: A Brooks-type theorem for the generalized list $T$-coloring, 41 (2003)

898: Tomáš Kaiser, Daniel Král', Riste Škrekovski: A revival of the girth conjecture, 41 (2003)

868: Veselin Jungić, Daniel Král', Riste Škrekovski: Colorings of plane graphs with no rainbow faces, 41 (2003)

816: Daniel Král', Riste Škrekovski: A theorem about the channel assignment problem, 40 (2002)