|
KABELA, A., KAISER, T. 10-tough chordal graphs are Hamiltonian. Journal of Combinatorial Theory, Series B, 2017, roč. 122, č. 1, s. 417-427. ISSN: 0095-8956
Detail
|
|
GAJARSKÝ, J., HLINĚNÝ, P., KAISER, T., KRÁL', D., KUPEC, M., OBDRŽÁLEK, J., ORDYNIAK, S., TŮMA, V. First order limits of sparse graphs: Plane trees and path-width. RANDOM STRUCTURES & ALGORITHMS, 2017, roč. 50, č. 4, s. 612-635. ISSN: 1042-9832
Detail
|
|
AHARONI, R., KAISER, T., ZERBIB, S. Fractional covers and matchings in families of weighted d-intervals. COMBINATORICA, 2017, roč. 37, č. 4, s. 555-572. ISSN: 0209-9683
Detail
|
|
Ryjáček, Z., Holub, P., Kaiser, T., Mockovčiaková, M., Rollová, E., Fleischner, H. Ninth workshop on the Matthews-Sumner conjecture and related problems. Plzeň, 09.04.2017 - 14.04.2017.
Detail
|
|
KAISER, T., LUKOŤKA, R., ROLLOVÁ, E. Nowhere-zero flows in signed graphs: a survey. Lecture Notes of Seminario Interdisciplinare di Matematica, 2017, roč. 14, č. Jun 2017, s. 85-104. ISSN: 2284-0206
Detail
|
|
KAISER, T., STEHLÍK, M. Schrijver graphs and projective quadrangulations. In A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek. Neuveden : Springer, 2017, s. 505-526. ISBN: 978-3-319-44478-9
Detail
|
|
KABELA, A., KAISER, T. 10-tough chordal graphs are Hamiltonian (talk). Chľaba pri Štúrove, Slovensko, 2016.
Detail
|
|
KAISER, T., ROLLOVÁ, E. Nowhere-Zero Flows in Signed Series-Parallel Graphs. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, roč. 30, č. 2, s. 1248-1258. ISSN: 0895-4801
Detail
|
|
ABREU, M., KAISER, T., LABBATE, D., MAZZUOCCOLO, G. Treelike snarks. ELECTRONIC JOURNAL OF COMBINATORICS, 2016, roč. 23, č. 3, s. #P3.54. ISSN: 1077-8926
Detail
|
|
KAISER, T., SAUMELL MENDIOLA, M., VAN CLEEMPUT, N. 10-Gabriel graphs are Hamiltonian. INFORMATION PROCESSING LETTERS, 2015, roč. 115, č. 11, s. 877-881. ISSN: 0020-0190
Detail
|
|
KAISER, T., STEHLÍK, M. Colouring quadrangulations of projective spaces. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, roč. 113, č. July, s. 1-17. ISSN: 0095-8956
Detail
|
|
BROERSMA, H., FIALA, J., GOLOVACH, P. A., KAISER, T., PAULUSMA, D., PROSKUROWSKI, A. Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. Journal of Graph Theory, 2015, roč. 79, č. 4, s. 282-299. ISSN: 0364-9024
Detail
|
|
DORBEC, P., KAISER, T., MONTASSIER, M., RASPAUD, A. Limits of near-coloring of sparse graphs. Journal of Graph Theory, 2014, roč. 75, č. 2, s. 191-202. ISSN: 0364-9024
Detail
|
|
KAISER, T., RYJÁČEK, Z., VRÁNA, P. On 1-Hamilton-connected claw-free graphs. DISCRETE MATHEMATICS, 2014, roč. 321, č. 1, s. 1-11. ISSN: 0012-365X
Detail
|
|
KAISER, T., STEHLÍK, M., ŠKREKOVSKI, R. Replication in critical graphs and the persistence of monomial ideals. JOURNAL OF COMBINATORIAL THEORY, SERIES A, 2014, roč. 123, č. 1, s. 239-251. ISSN: 0097-3165
Detail
|
|
KAISER, T., RUCKÝ, O., STEHLÍK, M., ŠKREKOVSKI, R. Strong parity vertex coloring of plane graphs. Discrete Mathematics and Theoretical Computer Science, 2014, roč. 16, č. 1, s. 143-158. ISSN: 1462-7264
Detail
|
|
KAISER, T., KANG, R. J. The distance-t chromatic index of graphs. COMBINATORICS PROBABILITY & COMPUTING, 2014, roč. 23, č. 1, s. 90-101. ISSN: 0963-5483
Detail
|
|
FERGUSON, D. G., KRÁL', D., KAISER, T. The fractional chromatic number of triangle-free subcubic graphs. EUROPEAN JOURNAL OF COMBINATORICS, 2014, roč. 35, č. January, s. 184-220. ISSN: 0195-6698
Detail
|
|
RYJÁČEK, Z., KAISER, T., VRÁNA, P. 1-Hamilton-connected (claw,hourglass)-free graphs. Nový Smokovec, Slovensko, 2013.
Detail
|
|
BROERSMA, H., FIALA, J., GOLOVACH, P.A., KAISER, T., PAULUSMA, D., PROSKUROWSKI, A. Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. In Lecture Notes in Computer Science. Heidelberg: Springer, 2013. s. 127-138. ISBN: 978-3-642-45042-6 , ISSN: 0302-9743
Detail
|
|
KAISER, T., SERENI, J., YILMA, Z. B. Multiple Petersen subdivisions in permutation graphs. ELECTRONIC JOURNAL OF COMBINATORICS, 2013, roč. 20, č. 1, s. 1-9. ISSN: 1077-8926
Detail
|
|
EKSTEIN, J., HOLUB, P., KAISER, T., KOCH, M., MATOS CAMACHO, S., RYJÁČEK, Z., SCHIERMEYER, I. The rainbow connection number of 2-connected graphs. DISCRETE MATHEMATICS, 2013, roč. 313, č. 19, s. 1884-1892. ISSN: 0012-365X
Detail
|
|
Kaiser, T., Král', D. Winter School on Algorithm Design. Beroun, 12.12.2013 - 15.12.2013.
Detail
|
|
JENDROL', S., KAISER, T., RYJÁČEK, Z., SCHIERMEYER, I. A Dirac theorem for trestles. Discrete Mathematics, 2012, roč. 312, č. 12-13, s. 2000-2004. ISSN: 0012-365X
Detail
|
|
KAISER, T. A short proof of the tree-packing theorem. DISCRETE MATHEMATICS, 2012, roč. 312, č. 10, s. 1689-1691. ISSN: 0012-365X
Detail
|
|
KAISER, T., VRÁNA, P. Hamilton cycles in 5-connected line graphs. EUROPEAN JOURNAL OF COMBINATORICS, 2012, roč. 33, č. 5, s. 924-947. ISSN: 0195-6698
Detail
|
|
VRÁNA, P., KAISER, T. Quasitrees with Tight Complements and Hamilton-connectedness in 3-connected Line Graphs. Nashville, 2012.
Detail
|
|
EKSTEIN, J., HOLUB, P., KAISER, T., XIONG, L., ZHANG, S. Star subdivisions and connected even factors in the square of a graph. DISCRETE MATHEMATICS, 2012, roč. 312, č. 17, s. 2574-2578. ISSN: 0012-365X
Detail
|
|
KAISER, T., MONTASSIER, M., RASPAUD, A. Covering a graph by forests and a matching. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, roč. 25, č. 4, s. 1804-1811. ISSN: 0895-4801
Detail
|
|
KAISER, T., KING, A., KRÁL, D. Fractional total colourings of graphs of high girth. Journal of Combinatorial Theory Series B, 2011, roč. 101, č. 6, s. 383-402. ISSN: 0095-8956
Detail
|
|
KAISER, T., RUCKÝ, O., ŠKREKOVSKI, R. Graphs with odd cycle lengths 5 and 7 are 3-colorable. SIAM Journal on Discrete Mathematics, 2011, roč. 25, č. 3, s. 1069-1088. ISSN: 0895-4801
Detail
|
|
KAISER, T., STEHLÍK, M., ŠKREKOVSKI, R. On the 2-resonance of fullerenes. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, roč. 25, č. 4, s. 1737-1745. ISSN: 0895-4801
Detail
|
|
DVOŘÁK, Z., KAISER, T., KRÁL', D., SERENI, J. .. -. S. .. A note on antisymmetric flows in graphs. European Journal of Combinatorics, 2010, roč. 31, č. 1, s. 320-324. ISSN: 0195-6698
Detail
|
|
KAISER, T. Doubly-critical graphs. Austin, TX, 2010.
Detail
|
|
GRÜNBAUM, B., KAISER, T., KRÁL', D., ROSENFELD, M. Equipartite polytopes. Israel Journal of Mathematics, 2010, roč. 179, č. 1, s. 235-252. ISSN: 0021-2172
Detail
|
|
ARDAL, H., DVOŘÁK, Z., JUNGIC, V., KAISER, T. On a Rado type problem for homogeneous second order linear recurrences. Electronic Journal of Combinatorics, 2010, roč. 17, č. 1, s. 1-17. ISSN: 1077-8926
Detail
|
|
KAISER, T., RASPAUD, A. Perfect matchings with restricted intersection in cubic graphs. European Journal of Combinatorics, 2010, roč. 31, č. 5, s. 1307-1315. ISSN: 0195-6698
Detail
|
|
KAISER, T., KRÁL', D., LIDICKÝ, B., NEJEDLÝ, P., ŠÁMAL, R. Short cycle covers of graphs with minimum degree three. SIAM Journal of Discrete Mathematics, 2010, roč. 24, č. 1, s. 330-355. ISSN: 0895-4801
Detail
|
|
EKSTEIN, J., HOLUB, P., KAISER, T. Star subdivisions and connected even factors. In Sborník abstraktů 45. česko-slovenské konference GRAFY 2010. Brno: Masarykova univerzita, 2010. s. 19. ISBN: 978-80-7231-723-3
Detail
|
|
KAISER, T. The doubly-critical graph conjecture. Bordeaux, Francie, 2010.
Detail
|
|
KAISER, T. Tree-packing and Hamilton cycles in 5-connected claw-free graphs. Oberwolfach, 2010.
Detail
|
|
JUNGIC, V., KAISER, T., KRÁL', D. A note on edge-colourings avoiding rainbow K_4 and monochromatic K_m. Electronic Journal of Combinatorics, 2009, roč. 16, č. 1, s. 1-9. ISSN: 1077-8926
Detail
|
|
ČADA, R., KAISER, T., ROSENFELD, M., RYJÁČEK, Z. Disjoint Hamilton cycles in the star graph. Information Processing Letters, 2009, roč. 110, č. 1, s. 30-35. ISSN: 0020-0190
Detail
|
|
KAISER, T. Minors of simplicial complexes. Discrete Applied Mathematics, 2009, roč. 157, č. 12, s. 2597-2602. ISSN: 0166-218X
Detail
|
|
BROERSMA, H., FIJAVŽ, G., KAISER, T., KUŽEL, R., RYJÁČEK, Z., VRÁNA, P. Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. Discrete Mathematics, 2008, roč. 308, č. 24, s. 6064-6077. ISSN: 0012-365X
Detail
|
|
KAISER, T., ŠKREKOVSKI, R. Cycles intersecting edge-cuts of prescribed sizes. SIAM Journal on Discrete Mathematics, 2008, roč. 22, č. 3, s. 861-874. ISSN: 0895-4801
Detail
|
|
KAISER, T. Disjoint T-paths in tough graphs. Journal of Graph Theory, 2008, roč. 59, č. 1, s. 1-10. ISSN: 0364-9024
Detail
|
|
GRÜNBAUM, B., KAISER, T., KRÁL, D., ROSENFELD, M. Equipartite graphs. Israel Journal of Mathematics, 2008, roč. 168, č. 1, s. 431-444. ISSN: 0021-2172
Detail
|
|
KAISER, T. Hamilton cycles in star graphs. Zadov, 2008.
Detail
|
|
KAISER, T. Matroids, minors and complexes. TU Wien, 2008.
Detail
|
|
FLANDRIN, E., KAISER, T., KUŽEL, R., LI, H., RYJÁČEK, Z. Neighborhood unions and extremal spanning trees. Discrete Mathematics, 2008, roč. 308, č. 12, s. 2343-2350. ISSN: 0012-365X
Detail
|
|
KAISER, T. Three problems on dominating cycles. Domažlice, 2008.
Detail
|
|
Holub, P., Kaiser, T., Ryjáček, Z. Česko-slovenská konference Grafy 2008. Zadov, 09.06.2008 - 13.06.2008.
Detail
|
|
KAISER, T., KUŽEL, R., LI, H., WANG, G. A note on k-walks in bridgeless graphs. Graphs and Combinatorics, 2007, roč. 23, č. 3, s. 303-308. ISSN: 0911-0119
Detail
|
|
BROERSMA, H., FIJAVŽ, G., KAISER, T., KUŽEL, R., RYJÁČEK, Z., VRÁNA, P. Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. Electronic Notes in Discrete Mathematics, 2007, roč. 28, s. 55-59. ISSN: 1571-0653
Detail
|
|
KAISER, T., KRÁL, D., ROSENFELD, M., RYJÁČEK, Z., VOSS, H. Hamiltonian cycles in prisms . Journal of Graph Theory, 2007, roč. 56, s. 249-269. ISSN: 0364-9024
Detail
|
|
CHEN, C., ČADA, R., KAISER, T., RYJÁČEK, Z. Short disjoint paths in locally connected graphs. Graphs and Combinatorics, 2007, roč. 23, s. 509-519. ISSN: 0911-0119
Detail
|
|
KAISER, T., ŠKREKOVSKI, R. T-joins intersecting small edge-cuts in graphs. Journal of Graph Theory, 2007, roč. 56, č. 1, s. 64-71. ISSN: 0364-9024
Detail
|
|
KAISER, T., KRÁL, D., ŠKREKOVSKI, R., ZHU, X. The circular chromatic index of graphs of high girth. Journal of Combinatorial Theory.Series B, 2007, roč. 97, s. 1-13. ISSN: 0095-8956
Detail
|
|
KAISER, T., KRÁL, D., STACHO, L. Tough spiders. Journal of Graph Theory, 2007, roč. 56, č. 1, s. 23-40. ISSN: 0364-9024
Detail
|
|
KAISER, T. A note on interconnecting matchings in graphs. Discrete Mathematics, 2006, roč. 306, č. 18, s. 2245-2250. ISSN: 0012-365X
Detail
|
|
KAISER, T., KUŽEL, R., LI, H., WANG, G. A note on k-walks in bridgeless graphs. 2006-289. vyd. Praha : Institut teoretické informatiky, 2006. 7 s.
Detail
|
|
KAISER, T. A revival of the girth conjecture. Bordeaux, 2006.
Detail
|
|
BROERSMA, H., FIJAVŽ, G., KAISER, T., KUŽEL, R., RYJÁČEK, Z. Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture in Snarks. Praha, 2006.
Detail
|
|
DVOŘÁK, Z., KAISER, T., KRÁL, D. Eulerian colorings and Fleischner's Bipartizing Matchings Conjecture. European Journal of Combinatorics, 2006, roč. 27, č. 7, s. 1088-1101. ISSN: 0195-6698
Detail
|
|
KAISER, T. Graphs with few odd cycle lengths. Tacoma, WA, 2006.
Detail
|
|
KAISER, T. Minors of simplicial complexes. Bratislava, 2006.
Detail
|
|
KAISER, T. Minors of simplicial complexes. 2006-288. vyd. Praha : Institut teoretické informatiky, 2006. 10 s.
Detail
|
|
KAISER, T. Non-intersecting perfect matchings in cubic graphs. Burnaby, BC, 2006.
Detail
|
|
KAISER, T. Non-intersecting perfect matchings in cubic graphs. Praha, 2006.
Detail
|
|
KAISER, T., RASPAUD, A. Non-intersecting perfect matchings in cubic graphs. 2006-320. vyd. Praha : Institut teoretické informatiky, 2006. 11 s.
Detail
|
|
KAISER, T., KRIESELL, M. On the pancyclicity of lexicographic products. Graphs and Combinatorics, 2006, roč. 22, č. 1, s. 51-58. ISSN: 0911-0119
Detail
|
|
KAISER, T. Prohledávání grafů. Brno, 2006.
Detail
|
|
KAISER, T. The dominating circuit conjecture. Tatranská Štrba, 2006.
Detail
|
|
KAISER, T., KRÁL, D., NORINE, S. Unions of perfect matchings in cubic graphs. In Topics in Discrete Mathematics. Berlin: Springer, 2006. s. 225-230. ISBN: 3-540-33698-2
Detail
|
|
Kaiser, T., Nešetřil, J., Cimprich, P. XMLPrague 2006. Praha, 17.06.2006 - 18.06.2006.
Detail
|
|
KAISER, T., ŠKREKOVSKI, R. Cycles intersecting edge-cuts of prescribed sizes. Berlin, 2005.
Detail
|
|
KAISER, T. Hamiltonovské struktury a souvislost grafů. 2005, 1 sv. (v různém stránkování) s.
Detail
|
|
KAISER, T., LI, M., XIONG, L., RYJÁČEK, Z. Hourglasses and Hamilton cycles in 4-connected claw-free graphs. Journal of Graph Theory, 2005, roč. 48, s. 267-276. ISSN: 0364-9024
Detail
|
|
KAISER, T., LI, M., RYJÁČEK, Z., XIONG, L. Hourglasses and Hamilton cycles in 4-connected claw-free graphs. Journal of Graph Theory, 2005, roč. 48, č. 4, s. 267-276. ISSN: 0364-9024
Detail
|
|
KAISER, T. Matroid intersection and 2-walks in tough graphs. Oxford University, 2005.
Detail
|
|
KAISER, T. Matroid intersection and 2-walks in tough graphs. Budmerice, 2005.
Detail
|
|
KAISER, T., KRÁL, D., ŠKREKOVSKI, R., ZHU, X. The circular chromatic index of graphs of large girth. Durham, 2005.
Detail
|
|
HORÁK, P., KAISER, T., ROSENFELD, M., RYJÁČEK, Z. The middle-levels problem. Praha, 2005.
Detail
|
|
HORÁK, P., KAISER, T., RYJÁČEK, Z., ROSENFELD, M. The prism over the middle-levels graph is hamiltonian. Order, 2005, roč. 22, č. 1, s. 73-81. ISSN: 0167-8094
Detail
|
|
HORÁK, P., KAISER, T., ROSENFELD, M., RYJÁČEK, Z. The prism over the middle-levels graph is hamiltonian. Praha : Institut teoretické informatiky, 2005. 10 s.
Detail
|
|
KAISER, T. Two problems on matchings and toughness. Praha, 2005.
Detail
|
|
Kaiser, T., Nešetřil, J., Cimprich, P. XMLPrague 2005. Praha, 25.06.2005 - 25.06.2005.
Detail
|
|
KAISER, T., KRÁL, D., ŠKREKOVSKI, R. A revival of the girth conjecture. Journal of Combinatorial Theory Ser. B, 2004, roč. 92, č. 1, s. 41-53. ISSN: 0095-8956
Detail
|
|
BROERSMA, H., FIJAVŽ, G., KAISER, T., KUŽEL, R., RYJÁČEK, Z. Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks. Tatranská Štrba, 2004.
Detail
|
|
BROERSMA, H., FIJAVŽ, G., KAISER, T., KUŽEL, R., RYJÁČEK, Z. Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture in Snarks. Paris, 2004.
Detail
|
|
BROERSMA, H., FIJAVŽ, G., KAISER, T., KUŽEL, R., RYJÁČEK, Z. Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. Praha : Institut teoretické informatiky, 2004. 11 s.
Detail
|
|
KAISER, T., ŠKREKOVSKI, R. Cycles intersecting edge-cuts of prescribed sizes. Praha : Institut teoretické informatiky, 2004. 16 s.
Detail
|
|
ČADA, R., KAISER, T., RYJÁČEK, Z. Diskrétní matematika. Plzeň : Západočeská univerzita, 2004, 170 s. ISBN: 80-7082-939-7
Detail
|
|
GRÜNBAUM, B., KAISER, T., KRÁL, D., ROSENFELD, M. Equipartite polytopes and graphs. Praha : Institut teoretické informatiky, 2004. 34 s.
Detail
|
|
ČADA, R., KAISER, T., ROSENFELD, M., RYJÁČEK, Z. Hamiltonian decompositions of prisms over cubic graphs. Discrete Mathematics, 2004, roč. 2004, s. 45-56. ISSN: 0012-365X
Detail
|
|
KAISER, T., ŠKREKOVSKI, R. Planar graph colorings without short monochromatic cycles. Journal of Graph Theory, 2004, roč. 46, s. 25-38. ISSN: 0364-9024
Detail
|
|
KAISER, T., KRÁL, D., ŠKREKOVSKI, R., ZHU, X. The circular chromatic index of graphs of high girth. Praha : Institut teoretické informatiky, 2004. 20 s.
Detail
|
|
KAISER, T., KRÁL, D., ROSENFELD, M., RYJÁČEK, Z., VOSS, H. Hamilton cycles in prisms over graphs. Dresden : Technische Universitat Dresden, 2003. 24 s.
Detail
|
|
RYJÁČEK, Z., KAISER, T., LI, M., XIONG, L. Hourglasses and Hamilton cycles in 4-connected claw-free graphs. Hájek, 2003.
Detail
|
|
KAISER, T., KLAZAR, M. On growth rates of closed permutation classes. Electronic Journal of Combinatorics, 2003, roč. 9, č. 2, s. 1-20. ISSN: 1097-1440
Detail
|