Tomás Kaiser

Orcid: 0000-0003-0448-0171

According to our database1, Tomás Kaiser authored at least 68 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




Rainbow Bases in Matroids.
SIAM J. Discret. Math., 2024

Graphs of low average degree without independent transversals.
J. Graph Theory, 2023

Quasigraphs and skeletal partitions.
Eur. J. Comb., 2023

Edge-critical subgraphs of Schrijver graphs II: The general case.
J. Comb. Theory B, 2022

Hamilton cycles in line graphs of 3-hypergraphs.
Discret. Math., 2022

The Hamiltonicity of essentially 9-connected line graphs.
J. Graph Theory, 2021

Edge-critical subgraphs of Schrijver graphs.
J. Comb. Theory B, 2020

Shorter signed circuit covers of graphs.
J. Graph Theory, 2019

Decomposing planar cubic graphs.
J. Graph Theory, 2018

Planar graphs have two-coloring number at most 8.
J. Comb. Theory B, 2018

First order limits of sparse graphs: Plane trees and path-width.
Random Struct. Algorithms, 2017

10-tough chordal graphs are Hamiltonian.
J. Comb. Theory B, 2017

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

Nowhere-Zero Flows in Signed Series-Parallel Graphs.
SIAM J. Discret. Math., 2016

Treelike Snarks.
Electron. J. Comb., 2016

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.
J. Graph Theory, 2015

Colouring quadrangulations of projective spaces.
J. Comb. Theory B, 2015

10-Gabriel graphs are Hamiltonian.
Inf. Process. Lett., 2015

10-tough chordal graphs are hamiltonian (Extended Abstract).
Electron. Notes Discret. Math., 2015

Weak regularity and finitely forcible graph limits.
Electron. Notes Discret. Math., 2015

Limits of Near-Coloring of Sparse Graphs.
J. Graph Theory, 2014

Replication in critical graphs and the persistence of monomial ideals.
J. Comb. Theory A, 2014

The fractional chromatic number of triangle-free subcubic graphs.
Eur. J. Comb., 2014

Strong parity vertex coloring of plane graphs.
Discret. Math. Theor. Comput. Sci., 2014

On 1-Hamilton-connected claw-free graphs.
Discret. Math., 2014

The Distance-<i>t</i> Chromatic Index of Graphs.
Comb. Probab. Comput., 2014

The rainbow connection number of 2-connected graphs.
Discret. Math., 2013

Multiple Petersen Subdivisions in Permutation Graphs.
Electron. J. Comb., 2013

Hamilton cycles in 5-connected line graphs.
Eur. J. Comb., 2012

A short proof of the tree-packing theorem.
Discret. Math., 2012

A Dirac theorem for trestles.
Discret. Math., 2012

Star subdivisions and connected even factors in the square of a graph.
Discret. Math., 2012

On the 2-Resonance of Fullerenes.
SIAM J. Discret. Math., 2011

Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable.
SIAM J. Discret. Math., 2011

Covering a Graph by Forests and a Matching.
SIAM J. Discret. Math., 2011

Fractional total colourings of graphs of high girth.
J. Comb. Theory B, 2011

Short Cycle Covers of Graphs with Minimum Degree Three.
SIAM J. Discret. Math., 2010

Perfect matchings with restricted intersection in cubic graphs.
Eur. J. Comb., 2010

A note on antisymmetric flows in graphs.
Eur. J. Comb., 2010

On a Rado Type Problem for Homogeneous Second Order Linear Recurrences.
Electron. J. Comb., 2010

Disjoint Hamilton cycles in the star graph.
Inf. Process. Lett., 2009

Hamilton cycles in 6-connected claw-free graphs (Extended abstract).
Electron. Notes Discret. Math., 2009

Minors of simplicial complexes.
Discret. Appl. Math., 2009

A Note on Edge-Colourings Avoiding Rainbow K<sub>4</sub> and Monochromatic K<sub>m</sub>.
Electron. J. Comb., 2009

Cycles Intersecting Edge-Cuts of Prescribed Sizes.
SIAM J. Discret. Math., 2008

Disjoint <i>T</i>-paths in tough graphs.
J. Graph Theory, 2008

Neighborhood unions and extremal spanning trees.
Discret. Math., 2008

<i>T</i>-joins intersecting small edge-cuts in graphs.
J. Graph Theory, 2007

Hamilton cycles in prisms.
J. Graph Theory, 2007

Tough spiders.
J. Graph Theory, 2007

The circular chromatic index of graphs of high girth.
J. Comb. Theory B, 2007

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

Short Disjoint Paths in Locally Connected Graphs.
Graphs Comb., 2007

Non-intersecting perfect matchings in cubic graphs (Extended abstract).
Electron. Notes Discret. Math., 2007

Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks.
Electron. Notes Discret. Math., 2007

On the Pancyclicity of Lexicographic Products.
Graphs Comb., 2006

Eulerian colorings and the bipartizing matchings conjecture of Fleischner.
Eur. J. Comb., 2006

A note on interconnecting matchings in graphs.
Discret. Math., 2006

The Prism Over the Middle-levels Graph is Hamiltonian.
Order, 2005

Hourglasses and Hamilton cycles in 4-connected claw-free graphs.
J. Graph Theory, 2005

Unions of perfect matchings in cubic graphs.
Electron. Notes Discret. Math., 2005

Planar graph colorings without short monochromatic cycles.
J. Graph Theory, 2004

A revival of the girth conjecture.
J. Comb. Theory B, 2004

Hamiltonian decompositions of prisms over cubic graphs.
Discret. Math., 2004

Line Transversals to Unit Disks.
Discret. Comput. Geom., 2002

On Growth Rates of Closed Permutation Classes.
Electron. J. Comb., 2002

Intersection Properties of Families of Convex (n, d)-Bodies.
Discret. Comput. Geom., 1999

Transversals of d-Intervals.
Discret. Comput. Geom., 1997