Roman Cada

Orcid: 0000-0002-6283-2975

According to our database1, Roman Cada authored at least 22 papers between 2004 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph.
CoRR, 2023

2020
A complete bipartite graph without properly colored cycles of length four.
J. Graph Theory, 2020

2018
Pairs of forbidden subgraphs and 2-connected supereulerian graphs.
Discret. Math., 2018

2017
On Dominating Even Subgraphs in Cubic Graphs.
SIAM J. Discret. Math., 2017

2016
Rainbow cycles in edge-colored graphs.
Discret. Math., 2016

2015
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture.
SIAM J. Discret. Math., 2015

Equivalence of Jackson's and Thomassen's conjectures.
J. Comb. Theory B, 2015

2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths.
Graphs Comb., 2015

2013
4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski.
SIAM J. Discret. Math., 2013

Circumferences of 2-factors in claw-free graphs.
Discret. Math., 2013

Radio labelings of distance graphs.
Discret. Appl. Math., 2013

2011
A Note on Degree Conditions for Traceability in Locally Claw-Free Graphs.
Math. Comput. Sci., 2011

2-factors in claw-free graphs.
Electron. Notes Discret. Math., 2011

2009
Disjoint Hamilton cycles in the star graph.
Inf. Process. Lett., 2009

Hamiltonicity and pancyclicity of cartesian products of graphs.
Discret. Math., 2009

2008
Degree conditions on induced claws.
Discret. Math., 2008

The *-closure for graphs and claw-free graphs.
Discret. Math., 2008

2007
Short Disjoint Paths in Locally Connected Graphs.
Graphs Comb., 2007

Path factors and line graphs.
Electron. Notes Discret. Math., 2007

2006
Hamiltonicity and pancyclicity of generalized prisms.
Electron. Notes Discret. Math., 2006

2004
Hamiltonian decompositions of prisms over cubic graphs.
Discret. Math., 2004

Cycles through given vertices and closures.
Discret. Math., 2004


  Loading...