SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Zdenek Ryjácek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Ralph J. Faudree, Zdenek Ryjácek, Ingo Schiermeyer
Local connectivity and cycle xtension in claw-free graphs. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1997, v:47, n:, pp:- [Journal]
Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
Shortest walks in almost claw-free graphs. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1996, v:42, n:, pp:- [Journal]
Ralph J. Faudree, Zdenek Ryjácek, Richard H. Schelp
On local and global independence numbers of a graph. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:79-84 [Journal]
Jan Brousek, Ralph J. Faudree, Zdenek Ryjácek
A note on hamiltonicity of generalized net-free graphs of large diameter. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2002, v:251, n:1-3, pp:77-85 [Journal]
Hajo Broersma, Zdenek Ryjácek
Strengthening the closure concept in claw-free graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2001, v:233, n:1-3, pp:55-63 [Journal]
Roman Cada, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
Cycles through given vertices and closures. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2004, v:276, n:1-3, pp:65-80 [Journal]
Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek
Hamiltonian decompositions of prisms over cubic graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2004, v:286, n:1-2, pp:45-56 [Journal]
Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
Clique covering and degree conditions for hamiltonicity in claw-free graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2001, v:236, n:1-3, pp:65-80 [Journal]
Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2002, v:256, n:1-2, pp:193-201 [Journal]
Ondrej Kovárík, Milos Mulac, Zdenek Ryjácek
A note on degree conditions for hamiltonicity in 2-connected claw-free graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2002, v:244, n:1-3, pp:253-268 [Journal]
Zdenek Ryjácek, Akira Saito, Richard H. Schelp
Claw-free graphs with complete closure. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2001, v:236, n:1-3, pp:325-338 [Journal]
Zdenek Ryjácek
Closure and Forbidden Pairs for Hamiltonicity. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 2002, v:86, n:2, pp:331-346 [Journal]
Zdenek Ryjácek
On a Closure Concept in Claw-Free Graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1997, v:70, n:2, pp:217-224 [Journal]
Peter Horák, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek
The Prism Over the Middle-levels Graph is Hamiltonian. [Citation Graph (0, 0)][DBLP]
Order, 2005, v:22, n:1, pp:73-81 [Journal]
Tomás Kaiser, MingChu Li, Zdenek Ryjácek, Liming Xiong
Hourglasses and Hamilton cycles in 4-connected claw-free graphs. [Citation Graph (0, 0)][DBLP]
Journal of Graph Theory, 2005, v:48, n:4, pp:267-276 [Journal]
Liming Xiong, Zdenek Ryjácek, Hajo Broersma
On stability of the hamiltonian index under contractions and closures. [Citation Graph (0, 0)][DBLP]
Journal of Graph Theory, 2005, v:49, n:2, pp:104-115 [Journal]
Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Zdenek Ryjácek
Induced S(K_{1, 3}) and hamiltonian cycles in the square of a graph. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1999, v:207, n:1-3, pp:263-269 [Journal]
Zdenek Ryjácek, Ingo Schiermeyer
2-factors and hamiltonicity. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1998, v:191, n:1-3, pp:171-177 [Journal]
Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp
Closure and Hamiltonian-connectivity of claw-free graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1999, v:195, n:1-3, pp:67-80 [Journal]
Jan Brousek, Zdenek Ryjácek, Odile Favaron
Forbidden subgraphs, hamiltonicity and closure in claw-free graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1999, v:196, n:1-3, pp:29-50 [Journal]
Jan Brousek, Zdenek Ryjácek, Ingo Schiermeyer
Forbidden subgraphs, stability and hamiltonicity. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1999, v:197, n:, pp:143-155 [Journal]
Ralph J. Faudree, Evelyne Flandrin, Zdenek Ryjácek
Claw-free graphs - A survey. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1997, v:164, n:1-3, pp:87-147 [Journal]
Zdenek Ryjácek
Matching extension in K_{1, r}-free graphs with independent claw centers. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1997, v:164, n:1-3, pp:257-263 [Journal]
H. J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer
Dirac's minimum degree condition restricted to claws. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1997, v:167, n:, pp:155-166 [Journal]
Zdenek Ryjácek, Ingo Schiermeyer
On the independence number in K_{1, r+1}-free graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1995, v:138, n:1-3, pp:365-374 [Journal]
Zdenek Ryjácek
Hamiltonicity in claw-free graphs through induced bulls. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1995, v:140, n:1-3, pp:141-147 [Journal]
Zdenek Ryjácek
N₂-locally disconnected graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1993, v:121, n:1-3, pp:189-193 [Journal]
Forbidden subgraphs that imply 2-factors. [Citation Graph (, )][DBLP]
Neighborhood unions and extremal spanning trees. [Citation Graph (, )][DBLP]
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. [Citation Graph (, )][DBLP]
Preface. [Citation Graph (, )][DBLP]
Closure and forbidden pairs for 2-factors. [Citation Graph (, )][DBLP]
Closure concept for 2-factors in claw-free graphs. [Citation Graph (, )][DBLP]
On cycle lengths in claw-free graphs with complete closure. [Citation Graph (, )][DBLP]

Search in 0.016secs, Finished in 0.321secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP