×

zbMATH — the first resource for mathematics

Kužel, Roman

Compute Distance To:
Author ID: kuzel.roman Recent zbMATH articles by "Kužel, Roman"
Published as: Kužel, Roman
Documents Indexed: 18 Publications since 2005

Publications by Year

Citations contained in zbMATH

10 Publications have been cited 48 times in 40 Documents Cited by Year
Neighborhood unions and extremal spanning trees. Zbl 1145.05017
Flandrin, Evelyne; Kaiser, Tomáš; Kužel, Roman; Li, Hao; Ryjáček, Zdeněk
14
2008
Thomassen’s conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs. Zbl 1242.05157
Kužel, Roman; Ryjáček, Zdeněk; Vrána, Petr
8
2012
Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks. Zbl 1157.05041
Broersma, Hajo; Fijavž, Gašper; Kaiser, Tomáš; Kužel, Roman; Ryjáček, Zdeněk; Vrána, Petr
8
2008
Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs. Zbl 1244.05130
Kužel, Roman; Ryjáček, Zdeněk; Teska, Jakub; Vrána, Petr
6
2012
2-factors and independent sets on claw-free graphs. Zbl 1232.05183
Kužel, Roman; Ozeki, Kenta; Yoshimoto, Kiyoshi
4
2012
A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs. Zbl 1186.05093
Kužel, Roman
3
2008
Exact interpolation scheme with approximation vector used as a column of the prolongator. Zbl 1374.65203
Kužel, Roman; Vaněk, Petr
2
2015
An overview of multilevel methods with aggressive coarsening and massive polynomial smoothing. Zbl 1327.65058
Brousek, Jan; Franková, Pavla; Hanuš, Milan; Kopincová, Hana; Kužel, Roman; Tezaur, Radek; Vaněk, Petr; Vastl, Zbyněk
1
2015
A note on \(k\)-walks in bridgeless graphs. Zbl 1124.05055
Kaiser, Tomáš; Kužel, Roman; Li, Hao; Wang, Guanghui
1
2007
Divisibility conditions in almost Moore digraphs with selfrepeats. Zbl 1202.05057
Teska, Jakub; Kužel, Roman; Miller, Mirka
1
2006
Exact interpolation scheme with approximation vector used as a column of the prolongator. Zbl 1374.65203
Kužel, Roman; Vaněk, Petr
2
2015
An overview of multilevel methods with aggressive coarsening and massive polynomial smoothing. Zbl 1327.65058
Brousek, Jan; Franková, Pavla; Hanuš, Milan; Kopincová, Hana; Kužel, Roman; Tezaur, Radek; Vaněk, Petr; Vastl, Zbyněk
1
2015
Thomassen’s conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs. Zbl 1242.05157
Kužel, Roman; Ryjáček, Zdeněk; Vrána, Petr
8
2012
Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs. Zbl 1244.05130
Kužel, Roman; Ryjáček, Zdeněk; Teska, Jakub; Vrána, Petr
6
2012
2-factors and independent sets on claw-free graphs. Zbl 1232.05183
Kužel, Roman; Ozeki, Kenta; Yoshimoto, Kiyoshi
4
2012
Neighborhood unions and extremal spanning trees. Zbl 1145.05017
Flandrin, Evelyne; Kaiser, Tomáš; Kužel, Roman; Li, Hao; Ryjáček, Zdeněk
14
2008
Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks. Zbl 1157.05041
Broersma, Hajo; Fijavž, Gašper; Kaiser, Tomáš; Kužel, Roman; Ryjáček, Zdeněk; Vrána, Petr
8
2008
A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs. Zbl 1186.05093
Kužel, Roman
3
2008
A note on \(k\)-walks in bridgeless graphs. Zbl 1124.05055
Kaiser, Tomáš; Kužel, Roman; Li, Hao; Wang, Guanghui
1
2007
Divisibility conditions in almost Moore digraphs with selfrepeats. Zbl 1202.05057
Teska, Jakub; Kužel, Roman; Miller, Mirka
1
2006

Citations by Year