![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Tomás Kaiser
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j69]Florian Hörsch, Tomás Kaiser, Matthias Kriesell:
Rainbow Bases in Matroids. SIAM J. Discret. Math. 38(2): 1472-1491 (2024) - 2023
- [j68]Tomás Kaiser, Petr Vrána:
Quasigraphs and skeletal partitions. Eur. J. Comb. 107: 103563 (2023) - [j67]Carla Groenland
, Tomás Kaiser
, Oscar Treffers, Matthew Wales:
Graphs of low average degree without independent transversals. J. Graph Theory 102(2): 374-387 (2023) - 2022
- [j66]Tomás Kaiser, Petr Vrána:
Hamilton cycles in line graphs of 3-hypergraphs. Discret. Math. 345(10): 113028 (2022) - [j65]Tomás Kaiser, Matej Stehlík:
Edge-critical subgraphs of Schrijver graphs II: The general case. J. Comb. Theory B 152: 453-482 (2022) - 2021
- [j64]Tomás Kaiser
, Petr Vrána:
The Hamiltonicity of essentially 9-connected line graphs. J. Graph Theory 97(2): 241-259 (2021) - 2020
- [j63]Tomás Kaiser
, Matej Stehlík:
Edge-critical subgraphs of Schrijver graphs. J. Comb. Theory B 144: 191-196 (2020)
2010 – 2019
- 2019
- [j62]Tomás Kaiser
, Robert Lukot'ka
, Edita Mácajová, Edita Rollová
:
Shorter signed circuit covers of graphs. J. Graph Theory 92(1): 39-56 (2019) - 2018
- [j61]Zdenek Dvorák, Adam Kabela, Tomás Kaiser
:
Planar graphs have two-coloring number at most 8. J. Comb. Theory B 130: 144-157 (2018) - [j60]Arthur Hoffmann-Ostenhof, Tomás Kaiser
, Kenta Ozeki
:
Decomposing planar cubic graphs. J. Graph Theory 88(4): 631-640 (2018) - 2017
- [j59]Ron Aharoni, Tomás Kaiser
, Shira Zerbib:
Fractional covers and matchings in families of weighted d-intervals. Comb. 37(4): 555-572 (2017) - [j58]Adam Kabela, Tomás Kaiser
:
10-tough chordal graphs are Hamiltonian. J. Comb. Theory B 122: 417-427 (2017) - [j57]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): 612-635 (2017) - 2016
- [j56]Marién Abreu, Tomás Kaiser, Domenico Labbate, Giuseppe Mazzuoccolo
:
Treelike Snarks. Electron. J. Comb. 23(3): 3 (2016) - [j55]Tomás Kaiser
, Edita Rollová:
Nowhere-Zero Flows in Signed Series-Parallel Graphs. SIAM J. Discret. Math. 30(2): 1248-1258 (2016) - 2015
- [j54]Jacob W. Cooper, Tomás Kaiser
, Daniel Král'
, Jonathan A. Noel
:
Weak regularity and finitely forcible graph limits. Electron. Notes Discret. Math. 49: 139-143 (2015) - [j53]Adam Kabela, Tomás Kaiser
:
10-tough chordal graphs are hamiltonian (Extended Abstract). Electron. Notes Discret. Math. 49: 331-336 (2015) - [j52]Tomás Kaiser
, Maria Saumell
, Nico Van Cleemput:
10-Gabriel graphs are Hamiltonian. Inf. Process. Lett. 115(11): 877-881 (2015) - [j51]Tomás Kaiser
, Matej Stehlík:
Colouring quadrangulations of projective spaces. J. Comb. Theory B 113: 1-17 (2015) - [j50]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): 282-299 (2015) - [i3]Jacob W. Cooper, Tomás Kaiser, Daniel Král, Jonathan A. Noel:
Weak regularity and finitely forcible graph limits. CoRR abs/1507.00067 (2015) - 2014
- [j49]Tomás Kaiser
, Ross J. Kang
:
The Distance-t Chromatic Index of Graphs. Comb. Probab. Comput. 23(1): 90-101 (2014) - [j48]Tomás Kaiser
, Zdenek Ryjácek, Petr Vrána
:
On 1-Hamilton-connected claw-free graphs. Discret. Math. 321: 1-11 (2014) - [j47]Tomás Kaiser, Ondrej Rucký, Matej Stehlík, Riste Skrekovski
:
Strong parity vertex coloring of plane graphs. Discret. Math. Theor. Comput. Sci. 16(1): 143-158 (2014) - [j46]David G. Ferguson, Tomás Kaiser
, Daniel Král'
:
The fractional chromatic number of triangle-free subcubic graphs. Eur. J. Comb. 35: 184-220 (2014) - [j45]Tomás Kaiser
, Matej Stehlík, Riste Skrekovski
:
Replication in critical graphs and the persistence of monomial ideals. J. Comb. Theory A 123(1): 239-251 (2014) - [j44]Paul Dorbec
, Tomás Kaiser
, Mickaël Montassier, André Raspaud:
Limits of Near-Coloring of Sparse Graphs. J. Graph Theory 75(2): 191-202 (2014) - [i2]Tomás Kaiser, Maria Saumell, Nico Van Cleemput:
10-Gabriel graphs are Hamiltonian. CoRR abs/1410.0309 (2014) - 2013
- [j43]Tomás Kaiser, Jean-Sébastien Sereni, Zelealem B. Yilma:
Multiple Petersen Subdivisions in Permutation Graphs. Electron. J. Comb. 20(1): 37 (2013) - [j42]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): 1884-1892 (2013) - [c1]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: 127-138 - [i1]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 abs/1301.5953 (2013) - 2012
- [j41]Tomás Kaiser
:
A short proof of the tree-packing theorem. Discret. Math. 312(10): 1689-1691 (2012) - [j40]Stanislav Jendrol'
, Tomás Kaiser
, Zdenek Ryjácek, Ingo Schiermeyer:
A Dirac theorem for trestles. Discret. Math. 312(12-13): 2000-2004 (2012) - [j39]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): 2574-2578 (2012) - [j38]Tomás Kaiser
, Petr Vrána
:
Hamilton cycles in 5-connected line graphs. Eur. J. Comb. 33(5): 924-947 (2012) - 2011
- [j37]Tomás Kaiser
, Andrew D. King, Daniel Král'
:
Fractional total colourings of graphs of high girth. J. Comb. Theory B 101(6): 383-402 (2011) - [j36]Tomás Kaiser
, Ondrej Rucký, Riste Skrekovski
:
Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable. SIAM J. Discret. Math. 25(3): 1069-1088 (2011) - [j35]Tomás Kaiser
, Matej Stehlík, Riste Skrekovski
:
On the 2-Resonance of Fullerenes. SIAM J. Discret. Math. 25(4): 1737-1745 (2011) - [j34]Tomás Kaiser
, Mickaël Montassier, André Raspaud:
Covering a Graph by Forests and a Matching. SIAM J. Discret. Math. 25(4): 1804-1811 (2011) - 2010
- [j33]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) - [j32]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): 320-324 (2010) - [j31]Tomás Kaiser
, André Raspaud:
Perfect matchings with restricted intersection in cubic graphs. Eur. J. Comb. 31(5): 1307-1315 (2010) - [j30]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): 330-355 (2010)
2000 – 2009
- 2009
- [j29]Veselin Jungic, Tomás Kaiser, Daniel Král':
A Note on Edge-Colourings Avoiding Rainbow K4 and Monochromatic Km. Electron. J. Comb. 16(1) (2009) - [j28]Tomás Kaiser
:
Minors of simplicial complexes. Discret. Appl. Math. 157(12): 2597-2602 (2009) - [j27]Tomás Kaiser
, Petr Vrána
:
Hamilton cycles in 6-connected claw-free graphs (Extended abstract). Electron. Notes Discret. Math. 34: 319-322 (2009) - [j26]Roman Cada
, Tomás Kaiser
, Moshe Rosenfeld, Zdenek Ryjácek:
Disjoint Hamilton cycles in the star graph. Inf. Process. Lett. 110(1): 30-35 (2009) - 2008
- [j25]Evelyne Flandrin, Tomás Kaiser
, Roman Kuzel, Hao Li, Zdenek Ryjácek:
Neighborhood unions and extremal spanning trees. Discret. Math. 308(12): 2343-2350 (2008) - [j24]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): 6064-6077 (2008) - [j23]Tomás Kaiser
:
Disjoint T-paths in tough graphs. J. Graph Theory 59(1): 1-10 (2008) - [j22]Tomás Kaiser
, Riste Skrekovski
:
Cycles Intersecting Edge-Cuts of Prescribed Sizes. SIAM J. Discret. Math. 22(3): 861-874 (2008) - 2007
- [j21]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: 55-59 (2007) - [j20]Tomás Kaiser
, André Raspaud:
Non-intersecting perfect matchings in cubic graphs (Extended abstract). Electron. Notes Discret. Math. 28: 293-299 (2007) - [j19]Tomás Kaiser
, Roman Kuzel, Hao Li, Guanghui Wang:
A Note on k -walks in Bridgeless Graphs. Graphs Comb. 23(3): 303-308 (2007) - [j18]Chuanping Chen, Roman Cada
, Tomás Kaiser
, Zdenek Ryjácek:
Short Disjoint Paths in Locally Connected Graphs. Graphs Comb. 23(5): 509-519 (2007) - [j17]Tomás Kaiser
, Daniel Král
, Riste Skrekovski
, Xuding Zhu:
The circular chromatic index of graphs of high girth. J. Comb. Theory B 97(1): 1-13 (2007) - [j16]Tomás Kaiser
, Daniel Král
, Ladislav Stacho:
Tough spiders. J. Graph Theory 56(1): 23-40 (2007) - [j15]Tomás Kaiser
, Riste Skrekovski
:
T-joins intersecting small edge-cuts in graphs. J. Graph Theory 56(1): 64-71 (2007) - [j14]Tomás Kaiser
, Zdenek Ryjácek, Daniel Král
, Moshe Rosenfeld, Heinz-Jürgen Voss:
Hamilton cycles in prisms. J. Graph Theory 56(4): 249-269 (2007) - 2006
- [j13]Tomás Kaiser
:
A note on interconnecting matchings in graphs. Discret. Math. 306(18): 2245-2250 (2006) - [j12]Zdenek Dvorák
, Tomás Kaiser
, Daniel Král
:
Eulerian colorings and the bipartizing matchings conjecture of Fleischner. Eur. J. Comb. 27(7): 1088-1101 (2006) - [j11]Tomás Kaiser
, Matthias Kriesell:
On the Pancyclicity of Lexicographic Products. Graphs Comb. 22(1): 51-58 (2006) - 2005
- [j10]Tomás Kaiser
, Daniel Král
, Serguei Norine:
Unions of perfect matchings in cubic graphs. Electron. Notes Discret. Math. 22: 341-345 (2005) - [j9]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): 267-276 (2005) - [j8]Peter Horák, Tomás Kaiser
, Moshe Rosenfeld, Zdenek Ryjácek:
The Prism Over the Middle-levels Graph is Hamiltonian. Order 22(1): 73-81 (2005) - 2004
- [j7]Roman Cada
, Tomás Kaiser
, Moshe Rosenfeld, Zdenek Ryjácek:
Hamiltonian decompositions of prisms over cubic graphs. Discret. Math. 286(1-2): 45-56 (2004) - [j6]Tomás Kaiser
, Daniel Král
, Riste Skrekovski
:
A revival of the girth conjecture. J. Comb. Theory B 92(1): 41-53 (2004) - [j5]Tomás Kaiser
, Riste Skrekovski
:
Planar graph colorings without short monochromatic cycles. J. Graph Theory 46(1): 25-38 (2004) - 2002
- [j4]Tomás Kaiser, Martin Klazar:
On Growth Rates of Closed Permutation Classes. Electron. J. Comb. 9(2) (2002) - [j3]Tomás Kaiser
:
Line Transversals to Unit Disks. Discret. Comput. Geom. 28(3): 379-387 (2002)
1990 – 1999
- 1999
- [j2]Tomás Kaiser
, Yuri Rabinovich:
Intersection Properties of Families of Convex (n, d)-Bodies. Discret. Comput. Geom. 21(2): 275-287 (1999) - 1997
- [j1]Tomás Kaiser
:
Transversals of d-Intervals. Discret. Comput. Geom. 18(2): 195-203 (1997)
Coauthor Index
aka: Daniel Král'
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-11 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint