Tomáš Kaiser

From MaRDI portal
Person:322208

Available identifiers

zbMath Open kaiser.tomasDBLP97/1485WikidataQ95168773 ScholiaQ95168773MaRDI QIDQ322208

List of research outcomes

PublicationDate of PublicationType
Graphs of low average degree without independent transversals2023-10-06Paper
The Hamiltonicity of essentially 9‐connected line graphs2023-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 partitions2022-10-07Paper
Rainbow bases in matroids2022-06-21Paper
Hamilton cycles in line graphs of 3-hypergraphs2022-06-14Paper
Edge-critical subgraphs of Schrijver graphs. II: The general case2021-11-17Paper
Edge-critical subgraphs of Schrijver graphs2020-07-07Paper
Shorter signed circuit covers of graphs2019-10-31Paper
Decomposing planar cubic graphs2018-08-16Paper
Planar graphs have two-coloring number at most 82018-04-18Paper
Weak regularity and finitely forcible graph limits2018-03-28Paper
Schrijver Graphs and Projective Quadrangulations2018-02-26Paper
Fractional covers and matchings in families of weighted \(d\)-intervals2018-02-12Paper
On the impulsiveness of multiuser interferences in TH-PPM-UWB systems2017-10-30Paper
Nowhere-zero flows in signed graphs: A survey2017-09-04Paper
First order limits of sparse graphs: Plane trees and path-width2017-08-10Paper
Treelike snarks2016-12-06Paper
10-tough chordal graphs are Hamiltonian2016-11-25Paper
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 Graphs2016-06-23Paper
Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs2015-07-23Paper
10-Gabriel graphs are Hamiltonian2015-07-15Paper
Colouring quadrangulations of projective spaces2015-06-10Paper
The fractional chromatic number of triangle-free subcubic graphs2014-07-29Paper
https://portal.mardi4nfdi.de/entity/Q54139072014-05-02Paper
The Distance-t Chromatic Index of Graphs2014-05-02Paper
Replication in critical graphs and the persistence of monomial ideals2014-01-31Paper
Limits of Near-Coloring of Sparse Graphs2014-01-28Paper
On 1-Hamilton-connected claw-free graphs2014-01-27Paper
The rainbow connection number of 2-connected graphs2013-12-06Paper
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs2013-12-06Paper
Hamilton cycles in 6-connected claw-free graphs (Extended abstract)2013-10-10Paper
Multiple Petersen subdivisions in permutation graphs2013-06-07Paper
Star subdivisions and connected even factors in the square of a graph2012-08-10Paper
A Dirac theorem for trestles2012-06-18Paper
A short proof of the tree-packing theorem2012-05-30Paper
Hamilton cycles in 5-connected line graphs2012-05-04Paper
Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable2012-03-15Paper
On the 2-Resonance of Fullerenes2012-03-15Paper
Covering a Graph by Forests and a Matching2012-03-15Paper
Fractional total colourings of graphs of high girth2011-12-08Paper
Short Cycle Covers of Graphs with Minimum Degree Three2011-03-15Paper
Equipartite polytopes2010-12-06Paper
Disjoint Hamilton cycles in the star graph2010-09-02Paper
https://portal.mardi4nfdi.de/entity/Q35767092010-07-30Paper
Perfect matchings with restricted intersection in cubic graphs2010-06-17Paper
Minors of simplicial complexes2010-04-28Paper
A note on edge-colourings avoiding rainbow \(K_{4}\) and monochromatic \(K_{m}\)2010-03-26Paper
On a Rado type problem for homogeneous second order linear recurrences2010-03-26Paper
A note on antisymmetric flows in graphs2009-12-01Paper
Cycles Intersecting Edge-Cuts of Prescribed Sizes2009-08-20Paper
Equipartite graphs2009-02-17Paper
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks2009-01-28Paper
DisjointT-paths in tough graphs2008-10-08Paper
Neighborhood unions and extremal spanning trees2008-05-13Paper
Tough spiders2008-01-04Paper
T‐joins intersecting small edge‐cuts in graphs2008-01-04Paper
Hamilton cycles in prisms2008-01-04Paper
Short disjoint paths in locally connected graphs2007-12-10Paper
A note on \(k\)-walks in bridgeless graphs2007-09-10Paper
Unions of perfect matchings in cubic graphs2007-05-29Paper
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks2007-05-29Paper
Non-intersecting perfect matchings in cubic graphs (Extended abstract)2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34248842007-03-05Paper
The circular chromatic index of graphs of high girth2007-01-11Paper
Eulerian colorings and the bipartizing matchings conjecture of Fleischner2006-11-15Paper
A note on interconnecting matchings in graphs2006-10-19Paper
On the pancyclicity of lexicographic products2006-06-16Paper
The prism over the middle-levels graph is Hamiltonian2006-05-02Paper
Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs2005-05-04Paper
A revival of the girth conjecture2004-10-01Paper
Hamiltonian decompositions of prisms over cubic graphs2004-10-01Paper
Planar graph colorings without short monochromatic cycles2004-08-06Paper
On growth rates of closed permutation classes2003-05-07Paper
Line transversals to unit disks2002-12-01Paper
Transversals of \(d\)-intervals1998-02-23Paper
https://portal.mardi4nfdi.de/entity/Q48849181996-08-20Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Tomáš Kaiser