Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Tomás
Last name:	Kaiser
DBLP:	97/1485
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 24 of 24  

Select a publication
Show	Title	Venue	Rating	Date
	Tomás Kaiser. Minors of simplicial complexes.	Discrete Applied Mathematics 2009, Volume 157	(0)	2009
	Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek. Disjoint Hamilton cycles in the star graph.	Inf. Process. Lett. 2009, Volume 110	(0)	2009
	Evelyne Flandrin, Tomás Kaiser, Roman Kuzel, Hao Li, Zdenek Ryjácek. Neighborhood unions and extremal spanning trees.	Discrete Mathematics 2008, Volume 308	(0)	2008
	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.	Discrete Mathematics 2008, Volume 308	(0)	2008
	Tomás Kaiser, Riste Skrekovski. Cycles Intersecting Edge-Cuts of Prescribed Sizes.	SIAM J. Discrete Math. 2008, Volume 22	(0)	2008
	Tomás Kaiser. Disjoint	Journal of Graph Theory 2008, Volume 59	(0)	2008
	Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu. The circular chromatic index of graphs of high girth.	J. Comb. Theory, Ser. B 2007, Volume 97	(0)	2007
	Tomás Kaiser, Daniel Král, Ladislav Stacho. Tough spiders.	Journal of Graph Theory 2007, Volume 56	(0)	2007
	Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss. Hamilton cycles in prisms.	Journal of Graph Theory 2007, Volume 56	(0)	2007
	Tomás Kaiser, André Raspaud. Non-intersecting perfect matchings in cubic graphs (Extended abstract).	Electronic Notes in Discrete Mathematics 2007, Volume 28	(0)	2007
	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.	Electronic Notes in Discrete Mathematics 2007, Volume 28	(0)	2007
	Tomás Kaiser. A note on interconnecting matchings in graphs.	Discrete Mathematics 2006, Volume 306	(0)	2006
	Zdenek Dvorak, Tomás Kaiser, Daniel Král. Eulerian colorings and the bipartizing matchings conjecture of Fleischner.	Eur. J. Comb. 2006, Volume 27	(0)	2006
	Tomás Kaiser, Matthias Kriesell. On the Pancyclicity of Lexicographic Products.	Graphs and Combinatorics 2006, Volume 22	(0)	2006
	Peter Horák, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek. The Prism Over the Middle-levels Graph is Hamiltonian.	Order 2005, Volume 22	(0)	2005
	Tomás Kaiser, MingChu Li, Zdenek Ryjácek, Liming Xiong. Hourglasses and Hamilton cycles in 4-connected claw-free graphs.	Journal of Graph Theory 2005, Volume 48	(0)	2005
	Tomás Kaiser, Daniel Král, Serguei Norine. Unions of perfect matchings in cubic graphs.	Electronic Notes in Discrete Mathematics 2005, Volume 22	(0)	2005
	Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek. Hamiltonian decompositions of prisms over cubic graphs.	Discrete Mathematics 2004, Volume 286	(0)	2004
	Tomás Kaiser, Daniel Král, Riste Skrekovski. A revival of the girth conjecture.	J. Comb. Theory, Ser. B 2004, Volume 92	(0)	2004
	Tomás Kaiser, Riste Skrekovski. Planar graph colorings without short monochromatic cycles.	Journal of Graph Theory 2004, Volume 46	(0)	2004
	Tomás Kaiser, Martin Klazar. On Growth Rates of Closed Permutation Classes.	Electr. J. Comb. 2002, Volume 0	(0)	2002
	Tomás Kaiser. Line Transversals to Unit Disks.	Discrete Computational Geometry 2002, Volume 28	(0)	2002
	Tomás Kaiser, Yuri Rabinovich. Intersection Properties of Families of Convex (n, d)-Bodies.	Discrete Computational Geometry 1999, Volume 21	(0)	1999
	Tomás Kaiser. Transversals of d-Intervals.	Discrete Computational Geometry 1997, Volume 18	(0)	1997

Your query returned 24 matches in the database.