Zdeněk Ryjáček - list of publications
[Preprints]   [Research papers]   [Textbooks]   [Graph Theory Hymn]
[Home]




Preprints

  • On cycle lengths in claw-free graphs with complete closure (with Zdzislaw Skupień, Krakov, Poland, and Petr Vrána, Plzeň).
    Preprint, submitted.
    [pdf-file] [pdf-file zipped]

  • Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks (with Hajo Broersma, Durham, England, Gašper Fijavž, Ljubljana, Slovenia, and Tomáš Kaiser, Roman Kužel and Petr Vrána, Plzeň).
    Preprint, submited.
    [pdf-file] [pdf-file zipped]

  • Neighborhood unions and extremal spanning trees (with Evelyne Flandrin and Hao Li, Orsay, France, and Tomáš Kaiser and Roman Kužel, Plzeň).
    Preprint, submited.
    [ps-file] [ps-file zipped]

  • Short disjoint paths in locally connected graphs (with Chuanping Chen, Beijing, China, and Roman Čada and Tomáš Kaiser, Plzeň).
    Preprint, submited.
    [ps-file] [ps-file zipped]

  • Hamiltonian cycles in prisms over graphs (with Tomáš Kaiser, Pilsen, Daniel Kráľ, Prague, Moshe Rosenfeld, Tacoma, U.S.A, and Heinz-Jürgen Voss, Dresden, Germany).
    Journal of Graph Theory (to appear).
    [ps-file] [ps-file zipped]

  • Forbidden Subgraphs that Imply 2-Factors (with J.R. Faudree, Fairbanks, U.S.A, and R.J. Faudree, Memphis, U.S.A).
    Discrete Mathematics (to appear).
    [ps-file] [ps-file zipped]

    •

    Published research papers

  • Exclusive sum labelings of trees (with Mauritsius Tuga, Mirka Miller and Joe Ryan, Ballarat, Australia).
    J. Combin. Math. Combin. Comput. 55 (2005), 109-121. [pdf-file] [pdf-file zipped]

  • The prism over the middle-levels graph is Hamiltonian (with Peter Horák and Moshe Rosenfeld, Tacoma, USA, and Tomáš Kaiser, Plzeň).
    Order 22 (2005), 73-81.
    [pdf-file] [pdf-file zipped]

  • On stability of the Hamiltonian index under contractions and closures (with Hajo Broersma, Enschede, Holandsko, and Liming Xiong, Beijing, China).
    Journal of Graph Theory 49 (2005), 104-115.
    [ps-file] [ps-file zipped]

  • Hourglasses and Hamilton cycles in 4-connected claw-free graphs (with Tomáš Kaiser, Plzeň, MingChu Li, Tianjin, China, and Liming Xiong, Beijing, China).
    Journal of Graph Theory 48 (2005), 267-276.
    [ps-file] [ps-file zipped]

  • Hamiltonian decompositions of prisms over cubic graphs (with Roman Čada and Tomáš Kaiser, Pilsen, and Moshe Rosenfeld, Tacoma, U.S.A).
    Discrete Mathematics 286 (2004), 45-56.
    [ps-file] [ps-file zipped]

  • On traceability and 2-factors in claw-free graphs (with Dalibor Fronček, Ostrava, and Zdzislaw Skupien, Kraków, Poland).
    Discussiones Mathematicae - Graph Theory 24 (2004), 55-71.
    [ps-file] [ps-file zipped]

  • Cycles through given vertices and closures (with R. Čada, Pilsen, and E. Flandrin and Hao Li, Orsay, France).
    Discrete Mathematics 276 (2004), 65-80.
    [ps-file] [ps-file zipped]

  • On local and global independence numbers of a graph (with Ralph J. Faudree and Richard H. Schelp, Memphis, U.S.A.).
    Discrete Applied Mathematics 132 (2003), 79-84.
    [ps-file] [ps-file zipped]

  • Regular clique covers of graphs (with Dan Archdeacon, Burlington, U.S.A., Dalibor Fronček, Ostrava, Robert Jajcay, Terre Haute, U.S.A., and Jozef Šíráň, Bratislava, Slovakia).
    Australasian Journal of Combinatorics 27 (2003), 307-316.
    [ps-file] [ps-file zipped]

  • Contractibility techniques as a closure concept (with Richard H. Schelp, Memphis, U.S.A.).
    Journal of Graph Theory 43 (2003), 37-48.
    [ps-file] [ps-file zipped]

  • Closure and forbidden pairs for hamiltonicity.
    Journal of Combinatorial Theory Ser. B 86 (2002), 331-346.
    [ps-file] [ps-file zipped]

  • A note on hamiltonicity of generalized net-free graphs of large diameter (with J. Brousek, Plzeň, and R.J. Faudree, Memphis, U.S.A.).
    Discrete Mathematics 251 (2002), 77-85.
    [ps-file] [ps-file zipped]

  • Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set (with J. Harant, Ilmenau, Germany, and I. Schiermeyer, Freiberg, Germany).
    Discrete Mathematics 256 (2002), 193-201.
    [ps-file] [ps-file zipped]

  • A note on degree conditions for hamiltonicity in 2-connected claw-free graphs (with O. Kovářík and M. Mulač, Plzeň).
    Discrete Mathematics 244 (2002), 253-268.
    [ps-file] [ps-file zipped]

  • Strengthening the closure concept in claw-free graphs (with H.J. Broersma, Enschede, The Netherlands).
    Discrete Mathematics 233 (2001), 55-63.
    [ps-file] [ps-file zipped]

  • On factors of 4-connected claw-free graphs (with H.J. Broersma, Enschede, The Netherlands, and M. Kriesell, Hannover, Germany).
    Journal of Graph Theory 37 (2001), 125-136.
    [ps-file] [ps-file zipped]

  • On weights of induced paths and cycles in claw-free graphs (with J. Harant, M. Voigt, Ilmenau, Germany, S. Jendroľ, Košice, Slovakia, B. Randerath, Aachen, Germany and I. Schiermeyer, Cottbus, Germany).
    Journal of Graph Theory 36 (2001), 131-143.
    [ps-file] [ps-file zipped]

  • Clique covering and degree conditions for hamiltonicity in claw-free graphs (with O. Favaron, E. Flandrin and Hao Li, Orsay, France).
    Discrete Mathematics 236 (2001), 65-80.
    [ps-file] [ps-file zipped]

  • Claw-free graphs with complete closure (with A. Saito, Tokyo, Japan and R.H. Schelp, Memphis, U.S.A.).
    Discrete Mathematics 236 (2001), 325-338.
    [ps-file] [ps-file zipped]

  • Closure concepts - a survey (with H.J. Broersma, Enschede, The Netherlands, and I. Schiermeyer, Cottbus, Germany).
    Graphs and Combinatorics 16 (2000), 17-48.
    [ps-file] [ps-file zipped]

  • Closure and stable hamiltonian properties in claw-free graphs (with S. Brandt, Berlin, Germany and O. Favaron, Orsay, France).
    Journal of Graph Theory 34 (2000), 30-41.
    [ps-file] [ps-file zipped]

  • Closure, 2-factors and cycle coverings in claw-free graphs (with A. Saito, Tokyo, Japan, and R.H. Schelp, Memphis, U.S.A.).
    Journal of Graph Theory 32 (1999), 109-117.
    [ps-file] [ps-file zipped]

  • Induced S(K1,3) and hamiltonian cycles in the square of a graph (with M. El Kadi Abderrezzak and E. Flandrin, Orsay, France).
    Discrete Mathematics 207 (1999), 263-269.
    [ps-file] [ps-file zipped]

  • Claw-free and generalized bull-free graphs of large diameter are hamiltonian (with R.J. Faudree, Memphis, U.S.A. and I. Schiermeyer, Cottbus, Germany).
    Tatra Mountains Math. Publications 18 (1999), 105-113.
    [ps-file] [ps-file zipped]

  • Forbidden subgraphs, stability and hamiltonicity (with J. Brousek, Plzeň and I. Schiermeyer, Cottbus, Germany).
    Discrete Mathematics 197/198 (1999), 143-155.
    [ps-file] [ps-file zipped]

  • Forbidden subgraphs, hamiltonicity and closure in claw-free graphs (with J. Brousek, Plzeň and O. Favaron, Orsay, France).
    Discrete Mathematics 196 (1999), 29-50.
    [ps-file] [ps-file zipped]

  • Closure and hamiltonian-connectivity of claw-free graphs (with A. Saito, Tokyo, Japan, B. Bolobás, O. Riordan and R.H. Schelp, Memphis, U.S.A.).
    Discrete Mathematics 195 (1999), 67-80.
    [ps-file] [ps-file zipped]

  • 2-factors and hamiltonicity (with I. Schiermeyer, Cottbus, Germany).
    Discrete Mathematics 191 (1998), 171-177.
    [ps-file] [ps-file zipped]

  • On a closure concept in claw-free graphs.
    Journal of Combinatorial Theory Ser. B. 70 (1997), 217-224.
    [ps-file] [ps-file zipped]

  • Factor criticality and matching extension in DCT-graphs (with O. Favaron and E. Flandrin, Orsay, France).
    Discussiones Mathematicae - Graph Theory 17 (1997), 271-278.
    [ps-file] [ps-file zipped]

  • Dirac's minimum degree condition restricted to claws (with H.J. Broersma, Enschede, The Netherlands and I. Schiermeyer, Aachen, Germany). 
    Discrete Mathematics 167/168 (1997), 155-166.
    [ps-file] [ps-file zipped]

  • Matching extension in K1,r-free graphs with independent claw centers.
    Discrete Mathematics 164(1997), 257-263.
    [ps-file] [ps-file zipped]

  • Claw-free graphs - a survey (with R.J. Faudree, Memphis, U.S.A. and E. Flandrin, Orsay, France).
    Discrete Mathematics 164 (1997), 87-147.
    [ps-file] [ps-file zipped]

  • Local connectivity and cycle extension in claw-free graphs (with R.J. Faudree, Memphis, U.S.A., and I. Schiermeyer, Aachen, Germany).
    Ars Combinatoria 47 (1997), 185-190.
    [ps-file] [ps-file zipped]

  • Unifying results on hamiltonian claw-free graphs (with H.J. Broersma, Enschede, The Netherlands and I. Schiermeyer, Aachen, Germany).
    Tatra Mountains Math. Publications 9 (1996), 31-39.
    [ps-file] [ps-file zipped]

  • Shortest walks in almost claw-free graphs (with O. Favaron, E. Flandrin and H. Li, Orsay, France).
    Ars Combinatoria 42 (1996), 223-232.
    [ps-file] [ps-file zipped]

  • Toughness and hamiltonicity in almost claw-free graphs (with H.J. Broersma, Enschede, The Netherlands and I. Schiermeyer, Aachen, Germany).
    Journal of Graph Theory 21 (1996), 431-439.
    [ps-file] [ps-file zipped]

  • Forbidden subgraphs and pancyclicity (with R.J. Faudree, Memphis, U.S.A., R.J. Gould, Atlanta, U.S.A. and I. Schiermeyer, Aachen, Germany).
    Congressus Numerantium 109 (1995), 13-32.
    [ps-file] [ps-file zipped]

  • The flower conjecture in special classes of graphs (with I. Schiermeyer, Aachen, Germany).
    Discussiones Mathematicae - Graph Theory 15 (1995), 179-184.
    [ps-file] [ps-file zipped]

  • Forbidden subgraphs and cycle extendability (with R.J. Faudree, Memphis, U.S.A., and I. Schiermeyer, Aachen, Germany).
    J. Combin. Math. Combin. Comput. 19 (1995), 109-128.
    [ps-file] [ps-file zipped]

  • On the independence number in K1,r+1-free graphs (with I. Schiermeyer, Aachen, Germany).
    Discrete Mathematics 138 (1995), 365-374.
    [ps-file] [ps-file zipped]

  • Hamiltonicity in claw-free graphs through induced bulls.
    Discrete Mathematics 140 (1995), 141-147.

  • Almost claw-free graphs.
    Journal of Graph Theory 18, (1994), No. 5, 469-477.

  • N2-locally disconnected graphs.
    Discrete Mathematics 121 (1993), 189-193.

  • Factors of claw-free graphs (with Zbigniew Lonc, Warsaw, Poland).
    Czechoslovak Math. Journal 41 (116) (1991), No. 1, 120-130.

  • Hamiltonian circuits in N2-locally connected K1,3-free graphs.
    Journal of Graph Theory 14 (1990), No. 3, 321-331.

  • Factors and circuits in K1,3-free graphs.
    Combinatorics and Graph Theory, Banach Centre Publications, Vol. 25, PWN, Warszawa 1989, 137-145.

  • Matchings and cycles in K1,3-free graphs.
    Graphen und Netzwerke, Proceedings of the 33rd Internationales Wissenschaftliches Kolloquium, Ilmenau, GDR, 1988, 243-245.

  • Graphs with non-isomorphic vertex neighbourhoods of the first and second types.
    Čas. pro pěst. mat. 112 (1987), No. 4, 390-394.

  • Locally disconnected graphs with large numbers of edges (with B. Zelinka, Liberec).
    Mathem. Slovaca 37 (1987), No. 2, 195-198.

  • On graphs with isomorphic, non-isomorphic and connected N2-neighbourhoods.
    Čas. pro pěst. mat. 112 (1987), No. 1, 66-79.

  • A contribution to the state model of electric network with excess capacitors (with D. Mayer, Plzeň).
    Acta technica ČSAV 27 (1982), No. 5, 517-531.

  • 3-polytopes of constant tolerance of edges (with S. Jendroľ, Košice).
    Comment. Math. Univ. Carol. 22 (1981), No. 4, 843-850.

  • On asymptotic stability of linear circuits with lumped parameters (with D. Mayer, Plzeň).
    Acta technica CSAV 24 (1979), No. 4, 459-465.

  • On asymptotic stability of linear passive electrical networks.
    Aplikace matematiky 24 (1979), No. 1, 48-55.

  • Analytic solution of transient phenomena in complicated linear electrical networks (with D. Mayer and B. Ulrych, Plzeň).
    Elektrotechnický obzor 64 (1978), No. 3, 137-145 (in Czech).

  • Investigation of steady-state of physical systems with periodic inputs (with D. Mayer and B. Ulrych, Plzeň).
    Acta technica CSAV 23 (1978), No. 2, 132-138.

  • A contribution to the modelling of electrical systems by electrical networks (with D. Mayer, Plzeň).
    Elektrotechnický časopis 29 (1978), No. 1, 4-20.

  • On weak non-linearity of models of physical systems (with D. Mayer, Plzeň).
    Aplikace matematiky 22 (1977), No. 4, 301-310.

    •

    Textbooks

  • Graph Theory and Discrete Optimization I, II.
    Textbook (in Czech), available at www pages:
    Part 1, Part 2.

  • Discrete Mathematics (with R. Čada a T. Kaiser, Plzeň).
    Textbook, UWB Plzeň, 2004 (in Czech).

  • Linear Algebra II - Introduction to Discrete Mathematics (with J. Holenda, Plzeň).
    Textbook, UWB Plzeň, 1992 (in Czech).

  • Problems and exercises in probability theory (with J. Brousek, Plzeň).
    Textbook, UWB Plzeň, 1991 (in Czech).

  • Selected topics in graph theory (with J. Holenda, Plzeň).
    Textbook, Tech. Univ. of Pilsen - Škoda concern, 197 pp., Plzeň, 1986 (in Czech).

    • Graph Theory Hymn

     Brief history

    [pdf-file]

    [pdf-file zipped]

    Back to the main page
    Back to the top of this page


       Czech version