| |
(2011-994) | Zdenek Dvorak: $3$-choosability of planar graphs with $(\le\!4)$-cycles far apart. PostScript (836 kB) BibTeX |
(2011-995) | Martin Tancer (ed.): Midsummer Combinatorial Workshop 2010. PDF (971 kB) BibTeX |
(2011-996) | Z. Dvorak, B. Lidicky, and R. Skrekovski: Graphs with two crossings are $5$-choosable. PDF (188 kB) BibTeX |
(2011-997) | D. Kral', M. Krnc, M. Kupec, B. Luzar, and J. Volec: Extending fractional precolorings. PostScript (465 kB) BibTeX |
(2011-998) | J. Bottcher and J. Foniok: Ramsey Properties of Permutations. PostScript (327 kB) BibTeX |
(2011-999) | H. Hatami, J. Hladky, D. Kral', S. Norine, and A. Razborov: Non-three-colorable common graphs exist. PostScript (441 kB) BibTeX |
(2011-1000) | Z. Dvorak, B. Lidicky, and R. Skrekovski: Bipartizing fullerenes. PDF (200 kB) BibTeX |
(2011-1001) | J. Ekstein, P. Holub, and B. Lidicky: Packing Chromatic Number of Distance Graphs. PDF (216 kB) BibTeX |
(2011-1002) | B. Banaschewski and A. Pultr: Completion and Samuel compactification of nearness and uniform frames. PostScript (351 kB) BibTeX |
(2011-1003) | Tomas Vyskocil (ed.): 37th International Workshop on Graph Theoretic Concepts in Computer Science. PDF (1303 kB) BibTeX |
(2011-1004) | Milan Hladik: Bounds on eigenvalues of complex interval matrices. PostScript (5464 kB) BibTeX |
(2011-1005) | Z. Dvorak and D. Kral': Classes of graphs with small rank decompositions are $\chi$-bounded. PostScript (280 kB) BibTeX |
(2011-1006) | D. Kral', L. Mach, and J-S Sereni: A new lower bound based on Gromov's method of selecting heavily covered points. PostScript (1104 kB) BibTeX |
(2011-1007) | T.H.Marshal: Homomorphism Bounds for Oriented Planar Graphs of Given Minimum Girth. PostScript (319 kB) BibTeX |
(2011-1008) | J.Nesetril, P.Ossona de Mendez, and X.Zhu: Colouring Edges with many Colours in Cycles. PDF (307 kB) BibTeX |
(2011-1009) | D. Kral', J-S Sereni, and L. Stacho: Min-max relations for odd cycles in planar graphs. PostScript (378 kB) BibTeX |
(2011-1010) | A. Korman, J-S Sereni, and L. Viennot: Toward More Localized Local Algorithms: Removing Assumptions Concerning Global Knowledge. PostScript (1337 kB) BibTeX |
(2011-1011) | T. Gavenciak, D. Kral', and S. Oum: Deciding First Order Logic Properties of Matroids. PostScript (473 kB) BibTeX |
(2011-1012) | F. Kardos, D. Kral', and J. Volec: Maximum edge-cuts incubic graphs with large girth and inrandom cubic graphs. PostScript (393 kB) BibTeX |
(2011-1013) | P. A. Golovach, B. Lidicky, B. Martin, and D. Paulusma: Finding vertex-surjective graph homomorphisms. PDF (269 kB) BibTeX |
(2011-1014) | Martin Tancer: $d$-representability of simplicial complexes of fixed dimension. PostScript (414 kB) BibTeX |
(2011-1015) | Martin Tancer: Intersection patterns of convex sets via simplicial complexes, a survey. PostScript (662 kB) BibTeX |
(2011-1017) | R. N. Ball and A. Pultr: Distributivity of the Normal Completion, and its Priestley Representation. PostScript (319 kB) BibTeX |
(2011-1018) | Zdenek Dvorak: Constant-factor approximation of domination number in sparse graphs. PostScript (107 kB) BibTeX |