dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Roman Kuzel Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoman Kuzel, Zdenek Ryjácek, Jakub Teska, Petr Vrána: Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs. Discrete Mathematics 312(14): 2177-2189 (2012)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoman Kuzel, Kenta Ozeki, Kiyoshi Yoshimoto: 2-factors and independent sets on claw-free graphs. Discrete Mathematics 312(2): 202-206 (2012)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoman Kuzel, Zdenek Ryjácek, Petr Vrána: Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs. Journal of Graph Theory 69(3): 241-250 (2012)
2011
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoman Kuzel, Jakub Teska: On 2-Connected Spanning Subgraphs with Bounded Degree in K1, r-Free Graphs. Graphs and Combinatorics 27(2): 199-206 (2011)
2008
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEvelyne Flandrin, Tomás Kaiser, Roman Kuzel, Hao Li, Zdenek Ryjácek: Neighborhood unions and extremal spanning trees. Discrete Mathematics 308(12): 2343-2350 (2008)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoman Kuzel: A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs. Discrete Mathematics 308(23): 5801-5804 (2008)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHajo 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. Discrete Mathematics 308(24): 6064-6077 (2008)
2007
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHajo 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. Electronic Notes in Discrete Mathematics 28: 55-59 (2007)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomás Kaiser, Roman Kuzel, Hao Li, Guanghui Wang: A Note on k -walks in Bridgeless Graphs. Graphs and Combinatorics 23(3): 303-308 (2007)
2006
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoman Kuzel: The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs. Electronic Notes in Discrete Mathematics 24: 101-104 (2006)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJakub Teska, Roman Kuzel, Mirka Miller: Divisibility conditions in almost Moore digraphs with selfrepeats. Electronic Notes in Discrete Mathematics 24: 161-163 (2006)
2005
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLiming Xiong, Roman Kuzel: A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs. Graphs and Combinatorics 21(1): 137-144 (2005)

Coauthor Index

1Hajo Broersma (H. J. Broersma) [5] [6]
2Gasper Fijavz [5] [6]
3Evelyne Flandrin [8]
4Tomás Kaiser [4] [5] [6] [8]
5Hao Li [4] [8]
6Mirka Miller [2]
7Kenta Ozeki [11]
8Zdenek Ryjácek [5] [6] [8] [10] [12]
9Jakub Teska [2] [9] [12]
10Petr Vrána [5] [6] [10] [12]
11Guanghui Wang [4]
12Liming Xiong [1]
13Kiyoshi Yoshimoto (Kiyoshi Yoshiomoto) [11]

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page