default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZdenek Ryjácek
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j91]Adam Kabela, Zdenek Ryjácek
, Mária Skyvová, Petr Vrána:
Every 3-connected {K1,3,Γ3}-free graph is Hamilton-connected. Discret. Math. 348(2): 114305 (2025)- 2024
- [j90]Adam Kabela, Zdenek Ryjácek, Mária Skyvová, Petr Vrána:
A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs. Discret. Math. 347(11): 114154 (2024) - 2023
- [j89]Zdenek Ryjácek, Petr Vrána:
Hamilton-connected {claw, bull}-free graphs. J. Graph Theory 102(1): 128-153 (2023) - [j88]Xia Liu, Zdenek Ryjácek, Petr Vrána, Liming Xiong, Xiaojing Yang:
Hamilton-connected {claw, net}-free graphs, I. J. Graph Theory 102(1): 154-179 (2023) - [j87]Xia Liu, Zdenek Ryjácek, Petr Vrána, Liming Xiong, Xiaojing Yang:
Hamilton-connected {claw,net}-free graphs, II. J. Graph Theory 103(1): 119-138 (2023) - 2022
- [j86]Christoph Brause, Trung Duy Doan, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4. Discret. Math. 345(6): 112837 (2022) - [j85]Christopher Purcell, Joe Ryan, Zdenek Ryjácek, Mária Skyvová:
On Exclusive Sum Labellings of Hypergraphs. Graphs Comb. 38(2): 46 (2022) - [j84]Premysl Holub, Zdenek Ryjácek, Petr Vrána, Shipeng Wang, Liming Xiong:
Forbidden pairs of disconnected graphs for 2-factor of connected graphs. J. Graph Theory 100(2): 209-231 (2022) - 2021
- [j83]Zdenek Ryjácek, Petr Vrána:
Every 3-connected {K1, 3, Z7}-free graph of order at least 21 is Hamilton-connected. Discret. Math. 344(6): 112350 (2021) - 2020
- [j82]Binlong Li, Kenta Ozeki, Zdenek Ryjácek, Petr Vrána:
Thomassen's conjecture for line graphs of 3-hypergraphs. Discret. Math. 343(6): 111838 (2020) - [j81]Zdenek Ryjácek, Petr Vrána, Liming Xiong:
A Note on Singular Edges and Hamiltonicity in Claw-Free Graphs with Locally Disconnected Vertices. Graphs Comb. 36(3): 665-677 (2020)
2010 – 2019
- 2019
- [j80]Christoph Brause, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
On forbidden induced subgraphs for K1, 3-free perfect graphs. Discret. Math. 342(6): 1602-1608 (2019) - [j79]Zdenek Ryjácek, Petr Vrána, Shipeng Wang:
Closure for {K1, 4, K1, 4 + e}-free graphs. J. Comb. Theory B 134: 239-263 (2019) - 2018
- [j78]Zdenek Ryjácek, Petr Vrána, Liming Xiong:
Hamiltonian properties of 3-connected {claw, hourglass}-free graphs. Discret. Math. 341(6): 1806-1815 (2018) - 2017
- [j77]Gábor Bacsó, Zdenek Ryjácek, Zsolt Tuza:
Coloring the cliques of line graphs. Discret. Math. 340(11): 2641-2649 (2017) - [j76]Mirka Miller, Joseph F. Ryan, Zdenek Ryjácek:
Characterisation of Graphs with Exclusive Sum Labelling. Electron. Notes Discret. Math. 60: 83-90 (2017) - 2016
- [j75]Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2. Discret. Math. 339(2): 1058-1068 (2016) - [j74]Roman Cada, Atsushi Kaneko, Zdenek Ryjácek, Kiyoshi Yoshimoto:
Rainbow cycles in edge-colored graphs. Discret. Math. 339(4): 1387-1392 (2016) - [j73]Jan Brousek, Premysl Holub, Zdenek Ryjácek, Petr Vrána:
Finite families of forbidden subgraphs for rainbow connection in graphs. Discret. Math. 339(9): 2304-2312 (2016) - 2015
- [j72]Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer:
On forbidden subgraphs and rainbow connection in graphs with minimum degree 2. Discret. Math. 338(3): 1-8 (2015) - [j71]Kenta Ozeki, Zdenek Ryjácek, Kiyoshi Yoshimoto:
2-factors with bounded number of components in claw-free graphs. Discret. Math. 338(5): 793-808 (2015) - [j70]Mirko Hornák, Zdenek Ryjácek, Martin Skoviera:
Preface. Discret. Math. 338(10): 1659 (2015) - [j69]Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
Rainbow connection and forbidden subgraphs. Discret. Math. 338(10): 1706-1713 (2015) - [j68]Christoph Brause, Ingo Schiermeyer, Premysl Holub, Zdenek Ryjácek, Petr Vrána, Rastislav Krivos-Bellus:
4-colorability of P6-free graphs. Electron. Notes Discret. Math. 49: 37-42 (2015) - [j67]Zdenek Ryjácek, Liming Xiong, Jun Yin:
Closure and Hamilton-Connected Claw-Free Hourglass-Free Graphs. Graphs Comb. 31(6): 2369-2376 (2015) - 2014
- [j66]Tomás Kaiser, Zdenek Ryjácek, Petr Vrána:
On 1-Hamilton-connected claw-free graphs. Discret. Math. 321: 1-11 (2014) - [j65]Zdenek Ryjácek, Petr Vrána:
A Closure for 1-Hamilton-Connectedness in Claw-Free Graphs. J. Graph Theory 75(4): 358-376 (2014) - 2013
- [j64]Jan Ekstein, Premysl Holub, Tomás Kaiser, Maria Koch, Stephan Matos Camacho, Zdenek Ryjácek, Ingo Schiermeyer:
The rainbow connection number of 2-connected graphs. Discret. Math. 313(19): 1884-1892 (2013) - [j63]Mirka Miller, Joe Ryan, Zdenek Ryjácek:
Distance-locally disconnected graphs. Discuss. Math. Graph Theory 33(1): 203-215 (2013) - [j62]Jill R. Faudree, Ralph J. Faudree, Zdenek Ryjácek, Petr Vrána:
On Forbidden Pairs Implying Hamilton-Connectedness. J. Graph Theory 72(3): 327-345 (2013) - [j61]Mirka Miller, Joe Ryan, Zdenek Ryjácek, Jakub Teska, Petr Vrána:
Stability of Hereditary Graph Classes Under Closure Operations. J. Graph Theory 74(1): 67-80 (2013) - 2012
- [j60]Stanislav Jendrol', Tomás Kaiser, Zdenek Ryjácek, Ingo Schiermeyer:
A Dirac theorem for trestles. Discret. Math. 312(12-13): 2000-2004 (2012) - [j59]Roman Kuzel, Zdenek Ryjácek, Jakub Teska, Petr Vrána:
Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs. Discret. Math. 312(14): 2177-2189 (2012) - [j58]Haitze J. Broersma, Zdenek Ryjácek, Petr Vrána:
How Many Conjectures Can You Stand? A Survey. Graphs Comb. 28(1): 57-75 (2012) - [j57]Roman Kuzel, Zdenek Ryjácek, Petr Vrána:
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs. J. Graph Theory 69(3): 241-250 (2012) - [j56]Binlong Li, Zdenek Ryjácek, Ying Wang, Shenggui Zhang:
Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs. SIAM J. Discret. Math. 26(3): 1088-1103 (2012) - 2011
- [j55]Zdenek Ryjácek, Gerhard J. Woeginger, Liming Xiong:
Hamiltonian index is NP-complete. Discret. Appl. Math. 159(4): 246-250 (2011) - [j54]Zdenek Ryjácek, Petr Vrána:
On stability of Hamilton-connectedness under the 2-closure in claw-free graphs. J. Graph Theory 66(2): 137-151 (2011) - [j53]Zdenek Ryjácek, Petr Vrána:
Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs. J. Graph Theory 66(2): 152-173 (2011) - 2010
- [j52]Jan Kratochvíl, Jaroslav Nesetril, Zdenek Ryjácek:
Preface. Discret. Math. 310(3): 371-372 (2010) - [j51]Zdenek Ryjácek, Zdzislaw Skupien, Petr Vrána:
On cycle lengths in claw-free graphs with complete closure. Discret. Math. 310(3): 570-574 (2010) - [j50]Zdenek Ryjácek, Khikmat Saburov:
Closure and forbidden pairs for 2-factors. Discret. Math. 310(10-11): 1564-1572 (2010) - [j49]Zdenek Ryjácek, Liming Xiong, Kiyoshi Yoshimoto:
Closure concept for 2-factors in claw-free graphs. Discret. Math. 310(10-11): 1573-1579 (2010)
2000 – 2009
- 2009
- [j48]Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek:
Disjoint Hamilton cycles in the star graph. Inf. Process. Lett. 110(1): 30-35 (2009) - 2008
- [j47]Jill R. Faudree, Ralph J. Faudree, Zdenek Ryjácek:
Forbidden subgraphs that imply 2-factors. Discret. Math. 308(9): 1571-1582 (2008) - [j46]Evelyne Flandrin, Tomás Kaiser, Roman Kuzel, Hao Li, Zdenek Ryjácek:
Neighborhood unions and extremal spanning trees. Discret. Math. 308(12): 2343-2350 (2008) - [j45]Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána:
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. Discret. Math. 308(24): 6064-6077 (2008) - 2007
- [j44]Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána:
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks. Electron. Notes Discret. Math. 28: 55-59 (2007) - [j43]Chuanping Chen, Roman Cada, Tomás Kaiser, Zdenek Ryjácek:
Short Disjoint Paths in Locally Connected Graphs. Graphs Comb. 23(5): 509-519 (2007) - [j42]Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss:
Hamilton cycles in prisms. J. Graph Theory 56(4): 249-269 (2007) - 2005
- [j41]Tomás Kaiser, Mingchu Li, Zdenek Ryjácek, Liming Xiong:
Hourglasses and Hamilton cycles in 4-connected claw-free graphs. J. Graph Theory 48(4): 267-276 (2005) - [j40]Liming Xiong, Zdenek Ryjácek, Hajo Broersma:
On stability of the hamiltonian index under contractions and closures. J. Graph Theory 49(2): 104-115 (2005) - [j39]Peter Horák, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek:
The Prism Over the Middle-levels Graph is Hamiltonian. Order 22(1): 73-81 (2005) - 2004
- [j38]Roman Cada, Evelyne Flandrin, Hao Li, Zdenek Ryjácek:
Cycles through given vertices and closures. Discret. Math. 276(1-3): 65-80 (2004) - [j37]Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek:
Hamiltonian decompositions of prisms over cubic graphs. Discret. Math. 286(1-2): 45-56 (2004) - [j36]Dalibor Froncek, Zdenek Ryjácek, Zdzislaw Skupien:
On traceability and 2-factors in claw-free graphs. Discuss. Math. Graph Theory 24(1): 55-71 (2004) - 2003
- [j35]Dan Archdeacon, Dalibor Froncek, Robert Jajcay, Zdenek Ryjácek, Jozef Sirán:
Regular clique covers of graphs. Australas. J Comb. 27: 307- (2003) - [j34]Ralph J. Faudree, Zdenek Ryjácek, Richard H. Schelp:
On local and global independence numbers of a graph. Discret. Appl. Math. 132(1-3): 79-84 (2003) - [j33]Zdenek Ryjácek, Richard H. Schelp:
Contractibility techniques as a closure concept. J. Graph Theory 43(1): 37-48 (2003) - 2002
- [j32]Ondrej Kovárík, Milos Mulac, Zdenek Ryjácek:
A note on degree conditions for hamiltonicity in 2-connected claw-free graphs. Discret. Math. 244(1-3): 253-268 (2002) - [j31]Jan Brousek, Ralph J. Faudree, Zdenek Ryjácek:
A note on hamiltonicity of generalized net-free graphs of large diameter. Discret. Math. 251(1-3): 77-85 (2002) - [j30]Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer:
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. Discret. Math. 256(1-2): 193-201 (2002) - [j29]Zdenek Ryjácek:
Closure and Forbidden Pairs for Hamiltonicity. J. Comb. Theory B 86(2): 331-346 (2002) - 2001
- [j28]Hajo Broersma, Zdenek Ryjácek:
Strengthening the closure concept in claw-free graphs. Discret. Math. 233(1-3): 55-63 (2001) - [j27]Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek:
Clique covering and degree conditions for hamiltonicity in claw-free graphs. Discret. Math. 236(1-3): 65-80 (2001) - [j26]Zdenek Ryjácek, Akira Saito, Richard H. Schelp:
Claw-free graphs with complete closure. Discret. Math. 236(1-3): 325-338 (2001) - [j25]Jochen Harant, Margit Voigt, Stanislav Jendrol', Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer:
On weights of induced paths and cycles in claw-free and K1, r-free graphs. J. Graph Theory 36(3): 131-143 (2001) - [j24]Haitze J. Broersma, Matthias Kriesell, Zdenek Ryjácek:
On factors of 4-connected claw-free graphs. J. Graph Theory 37(2): 125-136 (2001) - 2000
- [j23]Hajo Broersma, Zdenek Ryjácek, Ingo Schiermeyer:
Closure Concepts: A Survey. Graphs Comb. 16(1): 17-48 (2000) - [j22]Stephan Brandt, Odile Favaron, Zdenek Ryjácek:
Closure and stable Hamiltonian properties in claw-free graphs. J. Graph Theory 34(1): 30-41 (2000)
1990 – 1999
- 1999
- [j21]Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp:
Closure and Hamiltonian-connectivity of claw-free graphs. Discret. Math. 195(1-3): 67-80 (1999) - [j20]Jan Brousek, Zdenek Ryjácek, Odile Favaron:
Forbidden subgraphs, hamiltonicity and closure in claw-free graphs. Discret. Math. 196(1-3): 29-50 (1999) - [j19]Jan Brousek, Zdenek Ryjácek, Ingo Schiermeyer:
Forbidden subgraphs, stability and hamiltonicity. Discret. Math. 197-198: 143-155 (1999) - [j18]Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Zdenek Ryjácek:
Induced S(K1, 3) and hamiltonian cycles in the square of a graph. Discret. Math. 207(1-3): 263-269 (1999) - [j17]Zdenek Ryjácek, Akira Saito, Richard H. Schelp:
Closure, 2-factors, and cycle coverings in claw-free graphs. J. Graph Theory 32(2): 109-117 (1999) - 1998
- [j16]Zdenek Ryjácek, Ingo Schiermeyer:
2-factors and hamiltonicity. Discret. Math. 191(1-3): 171-177 (1998) - 1997
- [j15]Ralph J. Faudree, Zdenek Ryjácek, Ingo Schiermeyer:
Local connectivity and cycle xtension in claw-free graphs. Ars Comb. 47 (1997) - [j14]Ralph J. Faudree, Evelyne Flandrin, Zdenek Ryjácek:
Claw-free graphs - A survey. Discret. Math. 164(1-3): 87-147 (1997) - [j13]Zdenek Ryjácek:
Matching extension in K1, r-free graphs with independent claw centers. Discret. Math. 164(1-3): 257-263 (1997) - [j12]Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer:
Dirac's minimum degree condition restricted to claws. Discret. Math. 167-168: 155-166 (1997) - [j11]Odile Favaron, Zdenek Ryjácek:
Factor-criticality and matching extension in DCT-graphs. Discuss. Math. Graph Theory 17(2): 271-278 (1997) - [j10]Zdenek Ryjácek:
On a Closure Concept in Claw-Free Graphs. J. Comb. Theory B 70(2): 217-224 (1997) - 1996
- [j9]Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek:
Shortest walks in almost claw-free graphs. Ars Comb. 42 (1996) - [j8]Mariusz Meszka, Joanna Nowak, Zdenek Ryjácek, Bohdan Zelinka:
Hymn teorii grafów. Discuss. Math. Graph Theory 16(2): 219-223 (1996) - [j7]Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer:
Toughness and hamiltonicity in almost claw-free graphs. J. Graph Theory 21(4): 431-439 (1996) - 1995
- [j6]Zdenek Ryjácek, Ingo Schiermeyer:
On the independence number in K1, r+1-free graphs. Discret. Math. 138(1-3): 365-374 (1995) - [j5]Zdenek Ryjácek:
Hamiltonicity in claw-free graphs through induced bulls. Discret. Math. 140(1-3): 141-147 (1995) - [j4]Zdenek Ryjácek, Ingo Schiermeyer:
The flower conjecture in special classes of graphs. Discuss. Math. Graph Theory 15(2): 179-184 (1995) - 1994
- [j3]Zdenek Ryjácek:
Almost claw-free graphs. J. Graph Theory 18(5): 469-477 (1994) - 1993
- [j2]Zdenek Ryjácek:
N2-locally disconnected graphs. Discret. Math. 121(1-3): 189-193 (1993) - 1990
- [j1]Zdenek Ryjácek:
Hamiltonian circuits in N2-locally connected K1, 3-free graphs. J. Graph Theory 14(3): 321-331 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
