The MathNet Korea
Information Center for Mathematical Science

국내수학자

Information Center for Mathematical Science

국외수학자

Zdeněk Dvořák
이름 Zdeněk Dvořák 영어이름 Zdeněk Dvořák
이메일 소속기관 Charles University
home Four gravity results. Discrete Math. (2007), Vol 307, Pages 181-190
home Probabilistic strategies for the partition and plurality problems. Random Structures Algorithms (2007), Vol 30, Pages 63-77
home Coloring triangle-free graphs on surfaces. Lecture Notes in Comput. Sci. (2007), Vol , Pages 2-4
home List-coloring squares of sparse subcubic graphs. SIAM J. Discrete Math. (2008), Vol 22, Pages 139-159
home Coloring squares of planar graphs with girth six. European J. Combin. (2008), Vol 29, Pages 838-849
home Planar graphs of odd-girth at least 9 are homomorphic to the Petersen graph. SIAM J. Discrete Math. (2008), Vol 22, Pages 568-591
home On forbidden subdivision characterizations of graph classes. European J. Combin. (2008), Vol 29, Pages 1321-1332
home Noncrossing Hamiltonian paths in geometric graphs. Discrete Appl. Math. (2007), Vol 155, Pages 1096-1105
home Graph covering via shortest paths. Congr. Numer. (2007), Vol 187, Pages 145-155
home On planar mixed hypergraphs. Electron. J. Combin. (2001), Vol 8, Pages 23
home Complexity of pattern coloring of cycle systems. Lecture Notes in Comput. Sci. (2002), Vol , Pages 164-175
home An algorithm for cyclic edge connectivity of cubic graphs (extended abstract). Lecture Notes in Comput. Sci. (2004), Vol , Pages 236-247
home Locally consistent constraint satisfaction problems (extended abstract). Lecture Notes in Comput. Sci. (2004), Vol , Pages 469-480
home Noncrossing Hamiltonian paths in geometric graphs. Lecture Notes in Comput. Sci. (2004), Vol , Pages 86-97
home Coloring face hypergraphs on surfaces. European J. Combin. (2005), Vol 26, Pages 95-110
home Three optimal algorithms for balls of three colors. Lecture Notes in Comput. Sci. (2005), Vol , Pages 206-217
home Locally consistent constraint satisfaction problems. Theoret. Comput. Sci. (2005), Vol 348, Pages 187-206
home On the complexity of the $G$-reconstruction problem. Lecture Notes in Comput. Sci. (2005), Vol , Pages 196-205
home Eulerian colorings and the bipartizing matchings conjecture of Fleischner. European J. Combin. (2006), Vol 27, Pages 1088-1101
home A theorem about a contractible and light edge. SIAM J. Discrete Math. (2006), Vol 20, Pages 55-61
home Matchings and nonrainbow colorings. SIAM J. Discrete Math. (2008/09), Vol 23, Pages 344-348
home $k$-chromatic number of graphs on surfaces. SIAM J. Discrete Math. (2008/09), Vol 23, Pages 477-486
home Two-factors in orientated graphs with forbidden transitions. Discrete Math. (2009), Vol 309, Pages 104-112
home Distance constrained labelings of planar graphs with no short cycles. Discrete Appl. Math. (2009), Vol 157, Pages 2634-2645
home Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. Discrete Math. (2009), Vol 309, Pages 5899-5904
home Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract). Electron. Notes Discrete Math. (2009), Vol , Pages 101-105
home A note on antisymmetric flows in graphs. European J. Combin. (2010), Vol 31, Pages 320-324
home Toughness threshold for the existence of 2-walks in $K_4$-minor-free graphs. Discrete Math. (2010), Vol 310, Pages 642-651
home Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. J. Graph Theory (2010), Vol 63, Pages 129-145
home Pattern hypergraphs. Electron. J. Combin. (2010), Vol 17, Pages 20
home Small graph classes and bounded expansion. J. Combin. Theory Ser. B (2010), Vol 100, Pages 171-175
home On a Rado type problem for homogeneous second order linear recurrences. Electron. J. Combin. (2010), Vol 17, Pages 17
home Crossing-critical graphs with large maximum degree. J. Combin. Theory Ser. B (2010), Vol 100, Pages 413-417
home On recognizing graphs by numbers of homomorphisms. J. Graph Theory (2010), Vol 64, Pages 330-342
home 3-choosability of triangle-free planar graphs with constraints on 4-cycles. SIAM J. Discrete Math. (2010), Vol 24, Pages 934-945
home Spectral radius of finite and infinite planar graphs and of graphs of bounded genus. J. Combin. Theory Ser. B (2010), Vol 100, Pages 729-739
home Algorithms for classes of graphs with bounded expansion. Lecture Notes in Comput. Sci. (2010), Vol , Pages 17-32
home Randić index and the diameter of a graph. European J. Combin. (2011), Vol 32, Pages 434-442