Roman Kuzel

According to our database, Roman Kuzel authored at least 12 papers between 2005 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2015

Exact interpolation scheme with approximation vector used as a column of the prolongator.

Roman Kuzel, Petr Vanek

Numer. Linear Algebra Appl., 2015

2012

Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs.

Roman Kuzel, Zdenek Ryjácek, Petr Vrána

J. Graph Theory, 2012

Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs.

Roman Kuzel, Zdenek Ryjácek, Jakub Teska, Petr Vrána

Discret. Math., 2012

2-factors and independent sets on claw-free graphs.

Roman Kuzel, Kenta Ozeki, Kiyoshi Yoshimoto

Discret. Math., 2012

2011

On 2-Connected Spanning Subgraphs with Bounded Degree in <i>K</i>_{1, <i>r</i>}-Free Graphs.

Roman Kuzel, Jakub Teska

Graphs Comb., 2011

2008

A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs.

Roman Kuzel

Discret. Math., 2008

Neighborhood unions and extremal spanning trees.

Evelyne Flandrin, Tomás Kaiser, Roman Kuzel, Hao Li, Zdenek Ryjácek

Discret. Math., 2008

2007

A Note on <i>k</i> -walks in Bridgeless Graphs.

Tomás Kaiser, Roman Kuzel, Hao Li, Guanghui Wang

Graphs Comb., 2007

Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks.

Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána

Electron. Notes Discret. Math., 2007

2006

Divisibility conditions in almost Moore digraphs with selfrepeats.

Jakub Teska, Roman Kuzel, Mirka Miller

Electron. Notes Discret. Math., 2006

The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs.

Roman Kuzel

Electron. Notes Discret. Math., 2006

2005

A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs.

Liming Xiong, Roman Kuzel

Graphs Comb., 2005