Остановите войну!
for scientists:
default search action
Roman Cada
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i1]Roman Cada, Michitaka Furuya, Kenji Kimura, Kenta Ozeki, Christopher Purcell, Takamasa Yashima:
A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph. CoRR abs/2311.09042 (2023) - 2020
- [j21]Roman Cada, Kenta Ozeki, Kiyoshi Yoshimoto:
A complete bipartite graph without properly colored cycles of length four. J. Graph Theory 93(2): 168-180 (2020)
2010 – 2019
- 2018
- [j20]Roman Cada, Kenta Ozeki, Liming Xiong, Kiyoshi Yoshimoto:
Pairs of forbidden subgraphs and 2-connected supereulerian graphs. Discret. Math. 341(6): 1696-1707 (2018) - 2017
- [j19]Roman Cada, Shuya Chiba, Kenta Ozeki, Kiyoshi Yoshimoto:
On Dominating Even Subgraphs in Cubic Graphs. SIAM J. Discret. Math. 31(2): 890-907 (2017) - 2016
- [j18]Roman Cada, Atsushi Kaneko, Zdenek Ryjácek, Kiyoshi Yoshimoto:
Rainbow cycles in edge-colored graphs. Discret. Math. 339(4): 1387-1392 (2016) - 2015
- [j17]Roman Cada, Shuya Chiba, Kiyoshi Yoshimoto:
2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths. Graphs Comb. 31(1): 99-113 (2015) - [j16]Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto:
Equivalence of Jackson's and Thomassen's conjectures. J. Comb. Theory, Ser. B 114: 124-147 (2015) - [j15]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) - 2013
- [j14]Roman Cada, Jan Ekstein, Premysl Holub, Olivier Togni:
Radio labelings of distance graphs. Discret. Appl. Math. 161(18): 2876-2884 (2013) - [j13]Roman Cada, Shuya Chiba:
Circumferences of 2-factors in claw-free graphs. Discret. Math. 313(19): 1934-1943 (2013) - [j12]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) - 2011
- [j11]Roman Cada, Shuya Chiba, Kiyoshi Yoshimoto:
2-factors in claw-free graphs. Electron. Notes Discret. Math. 38: 213-219 (2011) - [j10]Roman Cada, Evelyne Flandrin, Haiyan Kang:
A Note on Degree Conditions for Traceability in Locally Claw-Free Graphs. Math. Comput. Sci. 5(1): 21-25 (2011)
2000 – 2009
- 2009
- [j9]Roman Cada, Evelyne Flandrin, Hao Li:
Hamiltonicity and pancyclicity of cartesian products of graphs. Discret. Math. 309(22): 6337-6343 (2009) - [j8]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
- [j7]Roman Cada:
The *-closure for graphs and claw-free graphs. Discret. Math. 308(23): 5585-5596 (2008) - [j6]Roman Cada:
Degree conditions on induced claws. Discret. Math. 308(23): 5622-5631 (2008) - 2007
- [j5]Roman Cada:
Path factors and line graphs. Electron. Notes Discret. Math. 28: 433-436 (2007) - [j4]Chuanping Chen, Roman Cada, Tomás Kaiser, Zdenek Ryjácek:
Short Disjoint Paths in Locally Connected Graphs. Graphs Comb. 23(5): 509-519 (2007) - 2006
- [j3]Evelyne Flandrin, Hao Li, Roman Cada:
Hamiltonicity and pancyclicity of generalized prisms. Electron. Notes Discret. Math. 24: 61-67 (2006) - 2004
- [j2]Roman Cada, Evelyne Flandrin, Hao Li, Zdenek Ryjácek:
Cycles through given vertices and closures. Discret. Math. 276(1-3): 65-80 (2004) - [j1]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)
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 2023-11-24 18:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint