Tomáš Kaiser

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Hypertree shrinking avoiding low degree vertices
(available as arXiv preprint)
N/APaper
Lower bound on the maximum denominator of fractional chromatic numbers
The Electronic Journal of Combinatorics
2026-05-29Paper
Hypertree shrinking avoiding low degree vertices
The Electronic Journal of Combinatorics
2026-03-20Paper
Criticality in Sperner's lemma
Combinatorica
2025-01-14Paper
Graphs of low average degree without independent transversals
Journal of Graph Theory
2023-10-06Paper
The Hamiltonicity of essentially 9‐connected line graphs
Journal of Graph Theory
2023-09-29Paper
Fan's lemma via bistellar moves2023-08-14Paper
Packing T-connectors in graphs needs more connectivity2023-08-14Paper
Criticality in Sperner's Lemma2023-01-09Paper
Quasigraphs and skeletal partitions
European Journal of Combinatorics
2022-10-07Paper
Rainbow bases in matroids2022-06-21Paper
Hamilton cycles in line graphs of 3-hypergraphs
Discrete Mathematics
2022-06-14Paper
Edge-critical subgraphs of Schrijver graphs. II: The general case
Journal of Combinatorial Theory. Series B
2021-11-17Paper
Edge-critical subgraphs of Schrijver graphs
Journal of Combinatorial Theory. Series B
2020-07-07Paper
Shorter signed circuit covers of graphs
Journal of Graph Theory
2019-10-31Paper
Decomposing planar cubic graphs
Journal of Graph Theory
2018-08-16Paper
Planar graphs have two-coloring number at most 8
Journal of Combinatorial Theory. Series B
2018-04-18Paper
Planar graphs have two-coloring number at most 8
Journal of Combinatorial Theory. Series B
2018-04-18Paper
Weak regularity and finitely forcible graph limits
Transactions of the American Mathematical Society
2018-03-28Paper
Schrijver graphs and projective quadrangulations
A Journey Through Discrete Mathematics
2018-02-26Paper
Fractional covers and matchings in families of weighted \(d\)-intervals
Combinatorica
2018-02-12Paper
On the impulsiveness of multiuser interferences in TH-PPM-UWB systems
IEEE Transactions on Signal Processing
2017-10-30Paper
Nowhere-zero flows in signed graphs: a survey
(available as arXiv preprint)
2017-09-04Paper
First order limits of sparse graphs: plane trees and path-width
Random Structures & Algorithms
2017-08-10Paper
First order limits of sparse graphs: plane trees and path-width
Random Structures & Algorithms
2017-08-10Paper
Treelike snarks
The Electronic Journal of Combinatorics
2016-12-06Paper
Treelike snarks
The Electronic Journal of Combinatorics
2016-12-06Paper
10-tough chordal graphs are Hamiltonian
Journal of Combinatorial Theory. Series B
2016-11-25Paper
Weak regularity and finitely forcible graph limits
(available as arXiv preprint)
2016-10-14Paper
Weak regularity and finitely forcible graph limits2016-10-14Paper
10-tough chordal graphs are Hamiltonian (extended abstract)2016-10-14Paper
Nowhere-zero flows in signed series-parallel graphs
SIAM Journal on Discrete Mathematics
2016-06-23Paper
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
Journal of Graph Theory
2015-07-23Paper
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
Journal of Graph Theory
2015-07-23Paper
10-Gabriel graphs are Hamiltonian
Information Processing Letters
2015-07-15Paper
Colouring quadrangulations of projective spaces
Journal of Combinatorial Theory. Series B
2015-06-10Paper
The fractional chromatic number of triangle-free subcubic graphs
European Journal of Combinatorics
2014-07-29Paper
Strong parity vertex coloring of plane graphs2014-05-02Paper
The distance-t chromatic index of graphs
Combinatorics, Probability and Computing
2014-05-02Paper
Replication in critical graphs and the persistence of monomial ideals
Journal of Combinatorial Theory. Series A
2014-01-31Paper
Limits of near-coloring of sparse graphs
Journal of Graph Theory
2014-01-28Paper
On 1-Hamilton-connected claw-free graphs
Discrete Mathematics
2014-01-27Paper
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Graph-Theoretic Concepts in Computer Science
2013-12-06Paper
The rainbow connection number of 2-connected graphs
Discrete Mathematics
2013-12-06Paper
Hamilton cycles in 6-connected claw-free graphs (extended abstract)
Electronic Notes in Discrete Mathematics
2013-10-10Paper
Multiple Petersen subdivisions in permutation graphs
The Electronic Journal of Combinatorics
2013-06-07Paper
Multiple Petersen subdivisions in permutation graphs
The Electronic Journal of Combinatorics
2013-06-07Paper
Star subdivisions and connected even factors in the square of a graph
Discrete Mathematics
2012-08-10Paper
A Dirac theorem for trestles
Discrete Mathematics
2012-06-18Paper
A short proof of the tree-packing theorem
Discrete Mathematics
2012-05-30Paper
Hamilton cycles in 5-connected line graphs
European Journal of Combinatorics
2012-05-04Paper
Graphs with odd cycle lengths 5 and 7 are 3-colorable
SIAM Journal on Discrete Mathematics
2012-03-15Paper
On the 2-resonance of fullerenes
SIAM Journal on Discrete Mathematics
2012-03-15Paper
Covering a graph by forests and a matching
SIAM Journal on Discrete Mathematics
2012-03-15Paper
Fractional total colourings of graphs of high girth
Journal of Combinatorial Theory. Series B
2011-12-08Paper
Short cycle covers of graphs with minimum degree three
SIAM Journal on Discrete Mathematics
2011-03-15Paper
Equipartite polytopes
Israel Journal of Mathematics
2010-12-06Paper
Disjoint Hamilton cycles in the star graph
Information Processing Letters
2010-09-02Paper
Cycles intersecting edge-cuts of prescribed sizes2010-07-30Paper
Perfect matchings with restricted intersection in cubic graphs
European Journal of Combinatorics
2010-06-17Paper
Minors of simplicial complexes
Discrete Applied Mathematics
2010-04-28Paper
A note on edge-colourings avoiding rainbow \(K_{4}\) and monochromatic \(K_{m}\)
The Electronic Journal of Combinatorics
2010-03-26Paper
A note on edge-colourings avoiding rainbow \(K_{4}\) and monochromatic \(K_{m}\)
The Electronic Journal of Combinatorics
2010-03-26Paper
On a Rado type problem for homogeneous second order linear recurrences
The Electronic Journal of Combinatorics
2010-03-26Paper
On a Rado type problem for homogeneous second order linear recurrences
The Electronic Journal of Combinatorics
2010-03-26Paper
A note on antisymmetric flows in graphs
European Journal of Combinatorics
2009-12-01Paper
Cycles Intersecting Edge-Cuts of Prescribed Sizes
SIAM Journal on Discrete Mathematics
2009-08-20Paper
Equipartite graphs
Israel Journal of Mathematics
2009-02-17Paper
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
Discrete Mathematics
2009-01-28Paper
Disjoint<i>T</i>-paths in tough graphs
Journal of Graph Theory
2008-10-08Paper
Neighborhood unions and extremal spanning trees
Discrete Mathematics
2008-05-13Paper
Tough spiders
Journal of Graph Theory
2008-01-04Paper
<i>T</i>‐joins intersecting small edge‐cuts in graphs
Journal of Graph Theory
2008-01-04Paper
Hamilton cycles in prisms
Journal of Graph Theory
2008-01-04Paper
Short disjoint paths in locally connected graphs
Graphs and Combinatorics
2007-12-10Paper
A note on k-walks in bridgeless graphs
Graphs and Combinatorics
2007-09-10Paper
Unions of perfect matchings in cubic graphs
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Non-intersecting perfect matchings in cubic graphs (Extended abstract)
Electronic Notes in Discrete Mathematics
2007-05-29Paper
scientific article; zbMATH DE number 5130820 (Why is no real title available?)2007-03-05Paper
The circular chromatic index of graphs of high girth
Journal of Combinatorial Theory. Series B
2007-01-11Paper
Eulerian colorings and the bipartizing matchings conjecture of Fleischner
European Journal of Combinatorics
2006-11-15Paper
A note on interconnecting matchings in graphs
Discrete Mathematics
2006-10-19Paper
On the pancyclicity of lexicographic products
Graphs and Combinatorics
2006-06-16Paper
The prism over the middle-levels graph is Hamiltonian
Order
2006-05-02Paper
Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs
Journal of Graph Theory
2005-05-04Paper
A revival of the girth conjecture
Journal of Combinatorial Theory. Series B
2004-10-01Paper
Hamiltonian decompositions of prisms over cubic graphs
Discrete Mathematics
2004-10-01Paper
Planar graph colorings without short monochromatic cycles
Journal of Graph Theory
2004-08-06Paper
On growth rates of closed permutation classes
The Electronic Journal of Combinatorics
2003-05-07Paper
On growth rates of closed permutation classes
The Electronic Journal of Combinatorics
2003-05-07Paper
Line transversals to unit disks
Discrete & Computational Geometry
2002-12-01Paper
Transversals of d-intervals
Discrete & Computational Geometry
1998-02-23Paper
scientific article; zbMATH DE number 897927 (Why is no real title available?)1996-08-20Paper


Research outcomes over time


This page was built for person: Tomáš Kaiser