Tomás Kaiser

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 15

Top Topics

Extended Abstract

Euclidean Reconstruction

Top Venues

J. Graph Theory

J. Comb. Theory, Ser. B

SIAM J. Discret. Math.

Publications

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