Tomás Kaiser - RankMe

74 papers B 1Journal 73

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Hypertree Shrinking Avoiding Low Degree Vertices. Electron. J. Comb. Karolína Hylasová, Tomás Kaiser
2024	J	`jnl`	Criticality in Sperner's Lemma. Comb. Tomás Kaiser, Matej Stehlík, Riste Skrekovski
2024	J	`jnl`	Rainbow Bases in Matroids. SIAM J. Discret. Math. Florian Hörsch, Tomás Kaiser, Matthias Kriesell
2023	J	`jnl`	Graphs of low average degree without independent transversals. J. Graph Theory Carla Groenland, Tomás Kaiser, Oscar Treffers, Matthew Wales
2023	J	`jnl`	Quasigraphs and skeletal partitions. Eur. J. Comb. Tomás Kaiser, Petr Vrána
2022	J	`jnl`	Edge-critical subgraphs of Schrijver graphs II: The general case. J. Comb. Theory B Tomás Kaiser, Matej Stehlík
2022	J	`jnl`	Hamilton cycles in line graphs of 3-hypergraphs. Discret. Math. Tomás Kaiser, Petr Vrána
2021	J	`jnl`	The Hamiltonicity of essentially 9-connected line graphs. J. Graph Theory Tomás Kaiser, Petr Vrána
2020	J	`jnl`	Edge-critical subgraphs of Schrijver graphs. J. Comb. Theory B Tomás Kaiser, Matej Stehlík
2019	J	`jnl`	Shorter signed circuit covers of graphs. J. Graph Theory Tomás Kaiser, Robert Lukot'ka, Edita Mácajová, Edita Rollová
2018	J	`jnl`	Decomposing planar cubic graphs. J. Graph Theory Arthur Hoffmann-Ostenhof, Tomás Kaiser, Kenta Ozeki
2018	J	`jnl`	Planar graphs have two-coloring number at most 8. J. Comb. Theory B Zdenek Dvorák, Adam Kabela, Tomás Kaiser
2017	J	`jnl`	10-tough chordal graphs are Hamiltonian. J. Comb. Theory B Adam Kabela, Tomás Kaiser
2017	J	`jnl`	First order limits of sparse graphs: Plane trees and path-width. Random Struct. Algorithms Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma
2017	J	`jnl`	Fractional covers and matchings in families of weighted d-intervals. Comb. Ron Aharoni, Tomás Kaiser, Shira Zerbib
2016	J	`jnl`	Nowhere-Zero Flows in Signed Series-Parallel Graphs. SIAM J. Discret. Math. Tomás Kaiser, Edita Rollová
2016	J	`jnl`	Treelike Snarks. Electron. J. Comb. Marién Abreu, Tomás Kaiser, Domenico Labbate, Giuseppe Mazzuoccolo
2015	J	`jnl`	10-Gabriel graphs are Hamiltonian. Inf. Process. Lett. Tomás Kaiser, Maria Saumell, Nico Van Cleemput
2015	J	`jnl`	10-tough chordal graphs are hamiltonian (Extended Abstract). Electron. Notes Discret. Math. Adam Kabela, Tomás Kaiser
2015	J	`jnl`	Colouring quadrangulations of projective spaces. J. Comb. Theory B Tomás Kaiser, Matej Stehlík
2015	J	`jnl`	Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. J. Graph Theory Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2015	J	`jnl`	Weak regularity and finitely forcible graph limits. CoRR Jacob W. Cooper, Tomás Kaiser, Daniel Král, Jonathan A. Noel
2015	J	`jnl`	Weak regularity and finitely forcible graph limits. Electron. Notes Discret. Math. Jacob W. Cooper, Tomás Kaiser, Daniel Král', Jonathan A. Noel
2014	J	`jnl`	10-Gabriel graphs are Hamiltonian. CoRR Tomás Kaiser, Maria Saumell, Nico Van Cleemput
2014	J	`jnl`	Limits of Near-Coloring of Sparse Graphs. J. Graph Theory Paul Dorbec, Tomás Kaiser, Mickaël Montassier, André Raspaud
2014	J	`jnl`	On 1-Hamilton-connected claw-free graphs. Discret. Math. Tomás Kaiser, Zdenek Ryjácek, Petr Vrána
2014	J	`jnl`	Replication in critical graphs and the persistence of monomial ideals. J. Comb. Theory A Tomás Kaiser, Matej Stehlík, Riste Skrekovski
2014	J	`jnl`	Strong parity vertex coloring of plane graphs. Discret. Math. Theor. Comput. Sci. Tomás Kaiser, Ondrej Rucký, Matej Stehlík, Riste Skrekovski
2014	J	`jnl`	The Distance- Comb. Probab. Comput. Tomás Kaiser, Ross J. Kang
2014	J	`jnl`	The fractional chromatic number of triangle-free subcubic graphs. Eur. J. Comb. David G. Ferguson, Tomás Kaiser, Daniel Král'
2013	J	`jnl`	Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs CoRR Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2013	B	`conf`	Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. WG Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2013	J	`jnl`	Multiple Petersen Subdivisions in Permutation Graphs. Electron. J. Comb. Tomás Kaiser, Jean-Sébastien Sereni, Zelealem B. Yilma
2013	J	`jnl`	The rainbow connection number of 2-connected graphs. Discret. Math. Jan Ekstein, Premysl Holub, Tomás Kaiser, Maria Koch, Stephan Matos Camacho, Zdenek Ryjácek, Ingo Schiermeyer
2012	J	`jnl`	A Dirac theorem for trestles. Discret. Math. Stanislav Jendrol', Tomás Kaiser, Zdenek Ryjácek, Ingo Schiermeyer
2012	J	`jnl`	A short proof of the tree-packing theorem. Discret. Math. Tomás Kaiser
2012	J	`jnl`	Hamilton cycles in 5-connected line graphs. Eur. J. Comb. Tomás Kaiser, Petr Vrána
2012	J	`jnl`	Star subdivisions and connected even factors in the square of a graph. Discret. Math. Jan Ekstein, Premysl Holub, Tomás Kaiser, Liming Xiong, Shenggui Zhang
2011	J	`jnl`	Covering a Graph by Forests and a Matching. SIAM J. Discret. Math. Tomás Kaiser, Mickaël Montassier, André Raspaud
2011	J	`jnl`	Fractional total colourings of graphs of high girth. J. Comb. Theory B Tomás Kaiser, Andrew D. King, Daniel Král'
2011	J	`jnl`	Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable. SIAM J. Discret. Math. Tomás Kaiser, Ondrej Rucký, Riste Skrekovski
2011	J	`jnl`	On the 2-Resonance of Fullerenes. SIAM J. Discret. Math. Tomás Kaiser, Matej Stehlík, Riste Skrekovski
2010	J	`jnl`	A note on antisymmetric flows in graphs. Eur. J. Comb. Zdenek Dvorák, Tomás Kaiser, Daniel Král', Jean-Sébastien Sereni
2010	J	`jnl`	On a Rado Type Problem for Homogeneous Second Order Linear Recurrences. Electron. J. Comb. Hayri Ardal, Zdenek Dvorák, Veselin Jungic, Tomás Kaiser
2010	J	`jnl`	Perfect matchings with restricted intersection in cubic graphs. Eur. J. Comb. Tomás Kaiser, André Raspaud
2010	J	`jnl`	Short Cycle Covers of Graphs with Minimum Degree Three. SIAM J. Discret. Math. Tomás Kaiser, Daniel Král', Bernard Lidický, Pavel Nejedlý, Robert Sámal
2009	J	`jnl`	A Note on Edge-Colourings Avoiding Rainbow K Electron. J. Comb. Veselin Jungic, Tomás Kaiser, Daniel Král'
2009	J	`jnl`	Disjoint Hamilton cycles in the star graph. Inf. Process. Lett. Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek
2009	J	`jnl`	Hamilton cycles in 6-connected claw-free graphs (Extended abstract). Electron. Notes Discret. Math. Tomás Kaiser, Petr Vrána
2009	J	`jnl`	Minors of simplicial complexes. Discret. Appl. Math. Tomás Kaiser
2008	J	`jnl`	Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. Discret. Math. Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána
2008	J	`jnl`	Cycles Intersecting Edge-Cuts of Prescribed Sizes. SIAM J. Discret. Math. Tomás Kaiser, Riste Skrekovski
2008	J	`jnl`	Disjoint J. Graph Theory Tomás Kaiser
2008	J	`jnl`	Neighborhood unions and extremal spanning trees. Discret. Math. Evelyne Flandrin, Tomás Kaiser, Roman Kuzel, Hao Li, Zdenek Ryjácek
2007	J	`jnl`	A Note on Graphs Comb. Tomás Kaiser, Roman Kuzel, Hao Li, Guanghui Wang
2007	J	`jnl`	Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks. Electron. Notes Discret. Math. Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána
2007	J	`jnl`	Hamilton cycles in prisms. J. Graph Theory Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss
2007	J	`jnl`	Non-intersecting perfect matchings in cubic graphs (Extended abstract). Electron. Notes Discret. Math. Tomás Kaiser, André Raspaud
2007	J	`jnl`	Short Disjoint Paths in Locally Connected Graphs. Graphs Comb. Chuanping Chen, Roman Cada, Tomás Kaiser, Zdenek Ryjácek
2007	J	`jnl`	The circular chromatic index of graphs of high girth. J. Comb. Theory B Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu
2007	J	`jnl`	Tough spiders. J. Graph Theory Tomás Kaiser, Daniel Král, Ladislav Stacho
2006	J	`jnl`	A note on interconnecting matchings in graphs. Discret. Math. Tomás Kaiser
2006	J	`jnl`	Eulerian colorings and the bipartizing matchings conjecture of Fleischner. Eur. J. Comb. Zdenek Dvorák, Tomás Kaiser, Daniel Král
2006	J	`jnl`	On the Pancyclicity of Lexicographic Products. Graphs Comb. Tomás Kaiser, Matthias Kriesell
2005	J	`jnl`	Hourglasses and Hamilton cycles in 4-connected claw-free graphs. J. Graph Theory Tomás Kaiser, Mingchu Li, Zdenek Ryjácek, Liming Xiong
2005	J	`jnl`	The Prism Over the Middle-levels Graph is Hamiltonian. Order Peter Horák, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek
2005	J	`jnl`	Unions of perfect matchings in cubic graphs. Electron. Notes Discret. Math. Tomás Kaiser, Daniel Král, Serguei Norine
2004	J	`jnl`	A revival of the girth conjecture. J. Comb. Theory B Tomás Kaiser, Daniel Král, Riste Skrekovski
2004	J	`jnl`	Hamiltonian decompositions of prisms over cubic graphs. Discret. Math. Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek
2004	J	`jnl`	Planar graph colorings without short monochromatic cycles. J. Graph Theory Tomás Kaiser, Riste Skrekovski
2002	J	`jnl`	Line Transversals to Unit Disks. Discret. Comput. Geom. Tomás Kaiser
2002	J	`jnl`	On Growth Rates of Closed Permutation Classes. Electron. J. Comb. Tomás Kaiser, Martin Klazar
1999	J	`jnl`	Intersection Properties of Families of Convex (n, d)-Bodies. Discret. Comput. Geom. Tomás Kaiser, Yuri Rabinovich
1997	J	`jnl`	Transversals of d-Intervals. Discret. Comput. Geom. Tomás Kaiser