IUUK-CE-ITI series 2009
| 2009-427 | Roman Čada, Přemysl Holub, Tomáš Kaiser, Roman Kužel and Jakub Teska Hamiltonian Graph Theory Workshop, Pavlov 2008 | |
| 2009-428 | V. Janota, J. Kosek (eds.) XML Prague 2009 | |
| 2009-429 | Daniel Kráľ, Edita Máčajová, Ján Mazák, Jean-Sébastien Sereni Circular Edge-Colorings of Cubic Graphs with Girth Six | |
| 2009-430 | Daniel Král', Ondřej Pangrác Introduction to Matroid Theory (Lecture Notes) | |
| 2009-431 | Pavel Surynek Path Planning for Multiple Robots in Bi-connected Environments | |
| 2009-432 | Pavel Surynek Finding Sub-optimal Solutions for Problems of Path Planning for Multiple Robots in Theta-like Environments | |
| 2009-433 | Veselin Jungić, Tomáš Kaiser, Daniel Kráľ A note on edge-colourings avoiding rainbow K4 and monochromatic Km | |
| 2009-434 | Tobias Műller, Attila Pór, Jean-Sébastien Sereni Graphs with four boundary vertices | |
| 2009-435 | Jaroslav Nešetřil, Patrice Ossona de Mendez, David R. Wood Characterisations and Examples of Graph Classes with Bounded Expansion | |
| 2009-436 | Dainis Zeps Forbidden Minors for Projective Plane are Free-Toroidal or Non-Toroidal | |
| 2009-437 | Jiří Fink, Petr Gregor Long paths and cycles in hypercubes with faulty vertices | |
| 2009-438 | Zdeněk Ryjáček, Gerhard J. Woeginger, Liming Xiong Hamiltonian index is NP-complete | |
| 2009-439 | Zdeněk Ryjáček, Petr Vrána On stability of Hamilton-connectedness under the 2-closure in claw-free graphs | |
| 2009-440 | Zdeněk Ryjáček, Petr Vrána Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs | |
| 2009-441 | Alexandr V. Kostochka, Daniel Kráľ, Jean-Sébastien Sereni, Michael Stiebitz Graphs with bounded tree-width and large odd-girth are almost bipartite | |
| 2009-442 | Daniel Kráľ Decomposition width---a new width parameter for matroids | |
| 2009-443 | Julia Böttcher, Jan Hladký, Diana Piguet The tripartite Ramsey number for trees | |
| 2009-444 | H. Fleischner, A. Graovac, P. Hell, W. Imrich, J. Nešetřil (eds.) Algebraic Graph Theory, Dubrovnik 2009 | |
| 2009-445 | Bernhard Banaschewski, Aleš Pultr Pointfree aspects of the T_D axiom of classical topology | |
| 2009-446 | Daniel Král' (ed.) Současné trendy teoretické informatiky 2009 | |
| 2009-447 | Jan Hladký, Daniel Král' Algebraic proof of Brooks' theorem | |
| 2009-448 | Matt DeVos, Agelos Georgakopoulos, Bojan Mohar, Robert Šámal An Eberhard-like theorem for pentagons and heptagons | |
| 2009-449 | Peter Allan, Julia Böttcher, Jan Hladký Filling the gap between Turán's theorem and Pósa's conjecture | |
| 2009-450 | Jaroslav Nešetřil, Patrice Ossona de Mendez On nowhere dense graphs | |
| 2009-451 | Jan Foniok, Jaroslav Neštřil, Aleš Pultr, Claude Tardiff Dualities and dual pairs in Heyting algebras | |
| 2009-452 | Jean-Sébastien Sereni, Matěj Stehlík Edge-face colouring of plane graphs with maximum degree nine | |
| 2009-453 | Jan Hladký, Mathias Schacht Note on bipartite graph tilings | |
| 2009-454 | Frédéric Havet, Bruce Reed, Jean-Sébastien Sereni L(p,1)-labelling of graphs | |
| 2009-455 | Daniel Král', Petr Škoda, Jan Volec Domination number of cubic graphs with large girth | |
| 2009-456 | Louis Esperet Dynamic list coloring of bipartite graphs | |
| 2009-457 | Louis Esperet, John Gimbel, Andrew King Covering line graphs with equivalence relations | |
| 2009-458 | Jan Hubička, Jaroslav Nešetřil On characteristics of homomorphism and embedding universal graphs | |
| 2009-459 | Jan Hladký, Daniel Kral', Serguei Norine Counting flags in triangle-free digraphs | |
| 2009-460 | Martin Tancer d-collapsibility is NP-complete for d at least 4 | |
| 2009-461 | Martin Tancer Non-representability of finite projective planes by convex sets | |
| 2009-462 | Jean-Sébastien Sereni, Matěj Stehlík On the sextet polynomial of fullerenes | |
| 2009-463 | Hayri Ardal, Zdenik Dvořák, Veselin Jungić, Tomáš Kaiser On a Rado Type Problem for Homogeneous Second Order Linear Recurrences | |
| 2009-464 | Jan Hubička, Jaroslav Nešetřil Homomorphism and embedding universal structures for restricted classes | |
| 2009-465 | Jiří Fink, Petr Gregor Long pairs of paths in faulty hypercubes | |
| 2009-466 | Codruţ Grosu, Jan Hladký The extremal function for partial bipartite tilings | |
| 2009-467 | Jiří Fink, Petr Gregor Long cycles in hypercubes with optimal number of faulty vertices | |
| 2009-468 | Július Czap, Stanislav Jendrol, František Kardoš Facial parity edge colouring | |
| 2009-469 | Matt DeVos, Bojan Mohar, Robert Šámal Unexpected behaviour of crossing sequences | |
| 2009-470 | Martin Loebl, Iain Moffatt The chromatic polynomial of fatgraphs and its categorification | |
| 2009-471 | Mihyun Kang, Martin Loebl The enumeration of planar graphs via Wick's theorem | |
| 2009-472 | Martin Loebl, Iain Moffatt A permanent formula for the Jones polynomial | |
| 2009-473 | Lukas Kencl, Martin Loebl DNA-Inspired Information Concealing | |
| 2009-474 | Martin Loebl, Gregor Masbaum On the optimality of the Arf Invariant Formula for graph polynomials | |
| 2009-475 | Jan Foniok, Komei Fukuda, Lorenz Klaus Combinatorial Characterizations of K-matrices | |
| 2009-476 | Tomáš Kaiser, Andrew King, Daniel Král' Fractional total colourings of graphs of high girth | |
| 2009-477 | Tomáš Kaiser A short proof of the tree-packing theorem | |
| 2009-478 | Robert Šámal Cubical coloring - fractional covering by cuts | |
| 2009-479 | Martin Loebl Enumeration and Algorithms | |
| 2009-480 | Zdeněk Dvořák, Archontia C. Giannopoulou, Dimitrios M. Thilikos Forbidden Graphs for Tree-depth | |
| 2009-481 | Ondřej Zajíček, Jiří Sgall, Tomáš Ebenlendr Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput | |
| 2009-482 | František Kardoš, Daniel Král', Jean-Sébastien Sereni The last fraction of a fractional conjecture | |
| 2009-483 | Louis Esperet, František Kardoš, Daniel Král' A superlinear bound on the number of perfect matchings in cubic bridgeless graphs | |
| 2009-484 | Zdeněk Dvořák, Daniel Král', Robin Thomas Deciding first-order properties for sparse graphs |
