Fakulta aplikovaných věd --> Katedra matematiky --> Oddělení diskrétní matematiky <<   o   >>
vedoucí oddělení	Doc. RNDr. Tomáš Kaiser, Ph.D.   kancelář:   UK-611a   telefon:   ++420 377 63 2627   e-mail:   kaisert @ kma.zcu.cz   www:   http:/www.KMA.zcu.cz/Tomas.Kaiser   (orion: http://home.zcu.cz/~kaisert)	HOME publikace granty konference výuka absolventi aktivity

Publikace

Nové články

On 1-Hamilton-connected claw-free graphs (spoluautoři Z. Ryjáček a P. Vrána), zasláno k publikaci.

Replication in critical graphs and the persistence of monomial ideals (spoluautoři M. Stehlík a R. Škrekovski), zasláno k publikaci.

The distance-t chromatic index of graphs (spoluautor R. Kang), zasláno k publikaci.

Strong parity vertex coloring of plane graphs (spoluautoři O. Rucký, M. Stehlík a R. Škrekovski), zasláno k publikaci.

Publikované články

Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs (spoluautoři H. Broersma, J. Fiala, P. A. Golovach, D. Paulusma a A. Proskurowski), přijato na konferenci WG 2013.

The fractional chromatic number of triangle-free subcubic graphs (spoluautoři D. Ferguson a D. Král'), European J. Combin., přijato k publikaci.

Multiple Petersen subdivisions in permutation graphs (spoluautoři J.-S. Sereni a Z. Yilma), Electron. J. Combin. 20 (1) (2013), #P37 (arXiv).

Limits of near-coloring of sparse graphs (spoluautoři P. Dorbec, M. Montassier a A. Raspaud), J. Graph Theory, přijato k publikaci.

The rainbow connection number of 2-connected graphs (spoluautoři J. Ekstein, P. Holub, M. Koch, S. Matos Camacho, Z. Ryjáček a I. Schiermeyer), Discrete Math. (2012), doi: 10.1016/j.disc.2012.04.022 (arXiv).

A Dirac theorem for trestles (spoluautoři S. Jendrol', Z. Ryjáček a I. Schiermeyer), Discrete Math. 312, 12-13 (2012), 2000-2004 (preprint).

A short proof of the tree-packing theorem, Discrete Math. 312 (2012), 1689-1691 (arXiv).

On the 2-resonance of fullerenes (spoluautoři M. Stehlík a R. Škrekovski), SIAM J. Discrete Math. 25 (2011), 1737-1745.

Covering a graph by forests and a matching (spoluautoři M. Montassier a A. Raspaud), SIAM J. Discrete Math. 25 (2011), 1804-1811 (arXiv).

Hamilton cycles in 5-connected line graphs (spoluautor P. Vrána), European J. Combin. 33 (2012), 924-947 (arXiv).

Star subdivisions and connected even factors in the square of a graph (spoluautoři J. Ekstein, P. Holub, L. Xiong a S. Zhang), Discrete Math. 312 (2012), 2574-2578 (arXiv).

Graphs with odd cycle lengths 5 and 7 are 3-colorable (spoluautoři O. Rucký a R. Škrekovski), SIAM J. Discrete Math. 25 (2011), 1069-1088.

Fractional total colourings of graphs of high girth (spoluautoři A. King a D. Král'), J. Combin. Theory Ser. B 101 (2011), 383-402.

Equipartite polytopes (spoluautoři B. Grünbaum, D. Král' a M. Rosenfeld), Israel J. Math. 179 (2010), 235-252.

On a Rado type problem for homogeneous second order linear recurrences (spoluautoři H. Ardal, Z. Dvořák a V. Jungic), Electr. J. Comb. 17 (1) (2010), #R38.

Short cycle covers of graphs with minimum degree three (spoluautoři D. Král', B. Lidický, P. Nejedlý a R. Šámal), SIAM J. Discrete Math. 24 (2010), 330-355.

Perfect matchings with restricted intersection in cubic graphs (spoluautor A. Raspaud), European J. Comb. 31 (2010), 1307-1315.

Disjoint Hamilton cycles in the star graph (spoluautoři R. Čada, M. Rosenfeld a Z. Ryjáček), Information Processing Letters 110 (2009), 30-35.

A note on antisymmetric flows in graphs (spoluautoři Z. Dvořák, D. Král' a J.-S. Sereni), European J. Comb. 31 (2010), 320-324.

A note on edge-colourings avoiding rainbow K₄ and monochromatic K_m (spoluautoři V. Jungic a D. Král'), Electr. J. Comb. 16 (1) (2009), #N19.

Equipartite graphs (spoluautoři B. Grünbaum, D. Král' a M. Rosenfeld), Israel J. Math. 168 (2008), 431-444.

Minors of simplicial complexes, Discrete Appl. Math. 157 (2009), 2597-2602.

Disjoint T-paths in tough graphs, J. Graph Theory 59 (2008), 1-10.

Cycles intersecting all edge-cuts of prescribed sizes (spoluautor R. Škrekovski), SIAM J. Discrete Math. 22 (2008), 861-874.

Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks (spoluautoři H. Broersma, G. Fijavž, R. Kužel, Z. Ryjáček a P. Vrána), Discrete Math. 308 (2008), 6064-6077.

Neighborhood unions and extremal spanning trees (spoluautoři E. Flandrin, R. Kužel, H. Li a Z. Ryjáček), Discrete Math. 308 (2008), 2343-2350.

Hamilton cycles in prisms over graphs (spoluautoři D. Král', M. Rosenfeld, Z. Ryjáček a H.-J. Voss), J. Graph Theory 54 (2007), 249-269.

Short disjoint paths in locally connected graphs (spoluautoři C. Chen, R. Čada a Z. Ryjáček), Graphs Comb. 23 (2007), 509-519.

A note on k-walks in bridgeless graphs (spoluautoři R. Kužel, H. Li a G. Wang), Graphs Comb. 23 (2007), 303-308.

Tough spiders (spoluautoři D. Král' a L. Stacho), J. Graph Theory 56 (2007), 23-40.

T-joins intersecting small edge-cuts in graphs (spoluautor R. Škrekovski), J. Graph Theory 56 (2007), 64-71.

The circular chromatic number of graphs of high girth (spoluautoři D. Král', R. Škrekovski a X. Zhu), J. Combin. Theory Ser. B 97 (2007), 1-13.

Unions of perfect matchings in cubic graphs (spoluautoři D. Král' a S. Norine), Topics in Discrete Mathematics, Algorithms Combin. 26, Springer, Berlin, 2006, pp. 225-230.

Eulerian colorings and Fleischner's Bipartizing Matchings Conjecture (spoluautoři Z. Dvořák a D. Král'), European J. Comb. 27 (2006), 1088-1101.

A note on interconnecting matchings in graphs, Discrete Math. 306 (2006), 2245-2250.

On the pancyclicity of lexicographic products (spoluautor M. Kriesell), Graphs Comb. 22 (2006), 51-58.

The prism over the middle-levels graph is hamiltonian (spoluautoři P. Horák, M. Rosenfeld a Z. Ryjáček), Order 22 (2005), 73-81.

Hourglasses and Hamilton cycles in 4-connected claw-free graphs (spoluautoři M. Li, Z. Ryjáček a L. Xiong), J. Graph Theory 48 (2005), 267-276.

Hamiltonian decompositions of prisms over cubic graphs (spoluautoři R. Čada, M. Rosenfeld a Z. Ryjáček), Discrete Math. 286 (2004), 45-56.

A revival of the Girth Conjecture (spoluautoři D. Král' a R. Škrekovski), J. Combin. Theory Ser. B 92 (2004), 41-53.

Planar graph colorings without short monochromatic cycles (spoluautor R. Škrekovski), J. Graph Theory 46 (2004), 25-38.

On growth rates of closed permutation classes (spoluautor M. Klazar), Electr. J. Comb. 9, 2 (2003), #R10.

Line transversals to unit disks, Discrete Comput. Geom. 28 (2002), 379-387.

Intersection properties of families of convex (n,d)-bodies (spoluautor Yu. Rabinovich), Discrete Comput. Geom. 21 (1999), 275-287.

Piercing problems and topological methods. Disertační práce, Universita Karlova, Praha, 1998.

Transversals of d-intervals, Discrete Comput. Geom. 18 (1997), 195-203.

A sufficient condition of full normality, Comment Math. Univ. Carolinae 37, 2 (1996), 381-389.

Poznámky a rozšířené abstrakty

Some problems on even factors in graphs, Midsummer Combinatorial Workshop 2011, Praha.

Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks (spoluautoři H. Broersma, G. Fijavž, R. Kužel, Z. Ryjáček a P. Vrána), 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications (Praha, 2006), Electronic Notes in Discrete Mathematics 28(2007), 55-59.

Non-intersecting perfect matchings in cubic graphs (Extended Abstract) (spoluautor A. Raspaud), 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications (Praha, 2006), Electronic Notes in Discrete Mathematics 28 (2007), 293-299.

Some problems on matchings and toughness, Midsummer Combinatorial Workshop 2005, Praha.

Cycles intersecting edge-cuts of specified sizes (Extended abstract) (spoluautor R. Škrekovski), Eurocomb 2005, Berlín, přijato.

Unions of perfect matchings in cubic graphs (Extended abstract) (spoluautoři D. Král' a S. Norine), 7th French International Colloquium on Graph Theory, 2005, přijato.

Eulerian colorings and Fleischner's Bipartizing matchings conjecture (Extended abstract) (spoluautoři Z. Dvořák a D. Král'), Eurocomb '03, Praha.

Tutte trails, Midsummer Combinatorial Workshop 2002, Praha.