default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr Vrána
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j41]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
- [j40]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
- [j39]Tomás Kaiser, Petr Vrána:
Quasigraphs and skeletal partitions. Eur. J. Comb. 107: 103563 (2023) - [j38]Zdenek Ryjácek, Petr Vrána:
Hamilton-connected {claw, bull}-free graphs. J. Graph Theory 102(1): 128-153 (2023) - [j37]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) - [j36]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
- [j35]Maria Chudnovsky, Adam Kabela, Binlong Li, Petr Vrána:
Forbidden Induced Pairs for Perfectness and $\omega$-Colourability of Graphs. Electron. J. Comb. 29(2) (2022) - [j34]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) - [j33]Petr Vrána, Xingzhi Zhan, Leilei Zhang:
Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. Discret. Math. 345(8): 112909 (2022) - [j32]Tomás Kaiser, Petr Vrána:
Hamilton cycles in line graphs of 3-hypergraphs. Discret. Math. 345(10): 113028 (2022) - [j31]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
- [j30]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) - [j29]Tomás Kaiser, Petr Vrána:
The Hamiltonicity of essentially 9-connected line graphs. J. Graph Theory 97(2): 241-259 (2021) - 2020
- [j28]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) - [j27]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
- [j26]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) - [j25]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
- [j24]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
- [j23]Binlong Li, Petr Vrána:
Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity. J. Graph Theory 84(3): 249-261 (2017) - 2016
- [j22]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) - [j21]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
- [j20]Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
Rainbow connection and forbidden subgraphs. Discret. Math. 338(10): 1706-1713 (2015) - [j19]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) - [j18]Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto:
Equivalence of Jackson's and Thomassen's conjectures. J. Comb. Theory B 114: 124-147 (2015) - [j17]Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto:
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture. SIAM J. Discret. Math. 29(1): 26-35 (2015) - 2014
- [j16]Tomás Kaiser, Zdenek Ryjácek, Petr Vrána:
On 1-Hamilton-connected claw-free graphs. Discret. Math. 321: 1-11 (2014) - [j15]Kenta Ozeki, Petr Vrána:
2-edge-Hamiltonian-connectedness of 4-connected plane graphs. Eur. J. Comb. 35: 432-448 (2014) - [j14]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
- [j13]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) - [j12]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) - [j11]Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto:
4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski. SIAM J. Discret. Math. 27(1): 141-144 (2013) - 2012
- [j10]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) - [j9]Tomás Kaiser, Petr Vrána:
Hamilton cycles in 5-connected line graphs. Eur. J. Comb. 33(5): 924-947 (2012) - [j8]Haitze J. Broersma, Zdenek Ryjácek, Petr Vrána:
How Many Conjectures Can You Stand? A Survey. Graphs Comb. 28(1): 57-75 (2012) - [j7]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) - 2011
- [j6]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) - [j5]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
- [j4]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)
2000 – 2009
- 2009
- [j3]Tomás Kaiser, Petr Vrána:
Hamilton cycles in 6-connected claw-free graphs (Extended abstract). Electron. Notes Discret. Math. 34: 319-322 (2009) - 2008
- [j2]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
- [j1]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)
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 22:26 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:
