Tomás Kaiser

According to our database, Tomás Kaiser authored at least 67 papers between 1997 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Graphs of low average degree without independent transversals.

Carla Groenland, Tomás Kaiser, Oscar Treffers, Matthew Wales

J. Graph Theory, 2023

Quasigraphs and skeletal partitions.

Tomás Kaiser, Petr Vrána

Eur. J. Comb., 2023

2022

Edge-critical subgraphs of Schrijver graphs II: The general case.

Tomás Kaiser, Matej Stehlík

J. Comb. Theory, Ser. B, 2022

Hamilton cycles in line graphs of 3-hypergraphs.

Tomás Kaiser, Petr Vrána

Discret. Math., 2022

2021

The Hamiltonicity of essentially 9-connected line graphs.

Tomás Kaiser, Petr Vrána

J. Graph Theory, 2021

2020

Edge-critical subgraphs of Schrijver graphs.

Tomás Kaiser, Matej Stehlík

J. Comb. Theory, Ser. B, 2020

2019

Shorter signed circuit covers of graphs.

Tomás Kaiser, Robert Lukot'ka, Edita Mácajová, Edita Rollová

J. Graph Theory, 2019

2018

Decomposing planar cubic graphs.

Arthur Hoffmann-Ostenhof, Tomás Kaiser, Kenta Ozeki

J. Graph Theory, 2018

Planar graphs have two-coloring number at most 8.

Zdenek Dvorák, Adam Kabela, Tomás Kaiser

J. Comb. Theory, Ser. B, 2018

2017

First order limits of sparse graphs: Plane trees and path-width.

Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma

Random Struct. Algorithms, 2017

10-tough chordal graphs are Hamiltonian.

Adam Kabela, Tomás Kaiser

J. Comb. Theory, Ser. B, 2017

Fractional covers and matchings in families of weighted d-intervals.

Ron Aharoni, Tomás Kaiser, Shira Zerbib

Comb., 2017

2016

Nowhere-Zero Flows in Signed Series-Parallel Graphs.

Tomás Kaiser, Edita Rollová

SIAM J. Discret. Math., 2016

Treelike Snarks.

Marién Abreu, Tomás Kaiser, Domenico Labbate, Giuseppe Mazzuoccolo

Electron. J. Comb., 2016

2015

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.

Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski

J. Graph Theory, 2015

Colouring quadrangulations of projective spaces.

Tomás Kaiser, Matej Stehlík

J. Comb. Theory, Ser. B, 2015

10-Gabriel graphs are Hamiltonian.

Tomás Kaiser, Maria Saumell, Nico Van Cleemput

Inf. Process. Lett., 2015

10-tough chordal graphs are hamiltonian (Extended Abstract).

Adam Kabela, Tomás Kaiser

Electron. Notes Discret. Math., 2015

Weak regularity and finitely forcible graph limits.

Jacob W. Cooper, Tomás Kaiser, Daniel Král', Jonathan A. Noel

Electron. Notes Discret. Math., 2015

2014

Limits of Near-Coloring of Sparse Graphs.

Paul Dorbec, Tomás Kaiser, Mickaël Montassier, André Raspaud

J. Graph Theory, 2014

Replication in critical graphs and the persistence of monomial ideals.

Tomás Kaiser, Matej Stehlík, Riste Skrekovski

J. Comb. Theory, Ser. A, 2014

The fractional chromatic number of triangle-free subcubic graphs.

David G. Ferguson, Tomás Kaiser, Daniel Král'

Eur. J. Comb., 2014

Strong parity vertex coloring of plane graphs.

Tomás Kaiser, Ondrej Rucký, Matej Stehlík, Riste Skrekovski

Discret. Math. Theor. Comput. Sci., 2014

On 1-Hamilton-connected claw-free graphs.

Tomás Kaiser, Zdenek Ryjácek, Petr Vrána

Discret. Math., 2014

The Distance-<i>t</i> Chromatic Index of Graphs.

Tomás Kaiser, Ross J. Kang

Comb. Probab. Comput., 2014

2013

The rainbow connection number of 2-connected graphs.

Jan Ekstein, Premysl Holub, Tomás Kaiser, Maria Koch, Stephan Matos Camacho, Zdenek Ryjácek, Ingo Schiermeyer

Discret. Math., 2013

Multiple Petersen Subdivisions in Permutation Graphs.

Tomás Kaiser, Jean-Sébastien Sereni, Zelealem B. Yilma

Electron. J. Comb., 2013

2012

Hamilton cycles in 5-connected line graphs.

Tomás Kaiser, Petr Vrána

Eur. J. Comb., 2012

A short proof of the tree-packing theorem.

Tomás Kaiser

Discret. Math., 2012

A Dirac theorem for trestles.

Stanislav Jendrol', Tomás Kaiser, Zdenek Ryjácek, Ingo Schiermeyer

Discret. Math., 2012

Star subdivisions and connected even factors in the square of a graph.

Jan Ekstein, Premysl Holub, Tomás Kaiser, Liming Xiong, Shenggui Zhang

Discret. Math., 2012

2011

On the 2-Resonance of Fullerenes.

Tomás Kaiser, Matej Stehlík, Riste Skrekovski

SIAM J. Discret. Math., 2011

Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable.

Tomás Kaiser, Ondrej Rucký, Riste Skrekovski

SIAM J. Discret. Math., 2011

Covering a Graph by Forests and a Matching.

Tomás Kaiser, Mickaël Montassier, André Raspaud

SIAM J. Discret. Math., 2011

Fractional total colourings of graphs of high girth.

Tomás Kaiser, Andrew D. King, Daniel Král'

J. Comb. Theory, Ser. B, 2011

2010

Short Cycle Covers of Graphs with Minimum Degree Three.

Tomás Kaiser, Daniel Král', Bernard Lidický, Pavel Nejedlý, Robert Sámal

SIAM J. Discret. Math., 2010

Perfect matchings with restricted intersection in cubic graphs.

Tomás Kaiser, André Raspaud

Eur. J. Comb., 2010

A note on antisymmetric flows in graphs.

Zdenek Dvorák, Tomás Kaiser, Daniel Král', Jean-Sébastien Sereni

Eur. J. Comb., 2010

On a Rado Type Problem for Homogeneous Second Order Linear Recurrences.

Hayri Ardal, Zdenek Dvorák, Veselin Jungic, Tomás Kaiser

Electron. J. Comb., 2010

2009

Disjoint Hamilton cycles in the star graph.

Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek

Inf. Process. Lett., 2009

Hamilton cycles in 6-connected claw-free graphs (Extended abstract).

Tomás Kaiser, Petr Vrána

Electron. Notes Discret. Math., 2009

Minors of simplicial complexes.

Tomás Kaiser

Discret. Appl. Math., 2009

A Note on Edge-Colourings Avoiding Rainbow K₄ and Monochromatic K_m.

Veselin Jungic, Tomás Kaiser, Daniel Král'

Electron. J. Comb., 2009

2008

Cycles Intersecting Edge-Cuts of Prescribed Sizes.

Tomás Kaiser, Riste Skrekovski

SIAM J. Discret. Math., 2008

Disjoint <i>T</i>-paths in tough graphs.

Tomás Kaiser

J. Graph Theory, 2008

Neighborhood unions and extremal spanning trees.

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

Discret. Math., 2008

2007

<i>T</i>-joins intersecting small edge-cuts in graphs.

Tomás Kaiser, Riste Skrekovski

J. Graph Theory, 2007

Hamilton cycles in prisms.

Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss

J. Graph Theory, 2007

Tough spiders.

Tomás Kaiser, Daniel Král, Ladislav Stacho

J. Graph Theory, 2007

The circular chromatic index of graphs of high girth.

Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu

J. Comb. Theory, Ser. B, 2007

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

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

Graphs Comb., 2007

Short Disjoint Paths in Locally Connected Graphs.

Chuanping Chen, Roman Cada, Tomás Kaiser, Zdenek Ryjácek

Graphs Comb., 2007

Non-intersecting perfect matchings in cubic graphs (Extended abstract).

Tomás Kaiser, André Raspaud

Electron. Notes Discret. Math., 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

On the Pancyclicity of Lexicographic Products.

Tomás Kaiser, Matthias Kriesell

Graphs Comb., 2006

Eulerian colorings and the bipartizing matchings conjecture of Fleischner.

Zdenek Dvorák, Tomás Kaiser, Daniel Král

Eur. J. Comb., 2006

A note on interconnecting matchings in graphs.

Tomás Kaiser

Discret. Math., 2006

2005

The Prism Over the Middle-levels Graph is Hamiltonian.

Peter Horák, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek

Order, 2005

Hourglasses and Hamilton cycles in 4-connected claw-free graphs.

Tomás Kaiser, Mingchu Li, Zdenek Ryjácek, Liming Xiong

J. Graph Theory, 2005

Unions of perfect matchings in cubic graphs.

Tomás Kaiser, Daniel Král, Serguei Norine

Electron. Notes Discret. Math., 2005

2004

Planar graph colorings without short monochromatic cycles.

Tomás Kaiser, Riste Skrekovski

J. Graph Theory, 2004

A revival of the girth conjecture.

Tomás Kaiser, Daniel Král, Riste Skrekovski

J. Comb. Theory, Ser. B, 2004

Hamiltonian decompositions of prisms over cubic graphs.

Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek

Discret. Math., 2004

2002

Line Transversals to Unit Disks.

Tomás Kaiser

Discret. Comput. Geom., 2002

On Growth Rates of Closed Permutation Classes.

Tomás Kaiser, Martin Klazar

Electron. J. Comb., 2002

1999

Intersection Properties of Families of Convex (n, d)-Bodies.

Tomás Kaiser, Yuri Rabinovich

Discret. Comput. Geom., 1999

1997

Transversals of d-Intervals.

Tomás Kaiser

Discret. Comput. Geom., 1997