IUUK-CE-ITI series 2005

2005-235 Z.Dvořák, R.Škrekovski
A theorem about a contractible and light edge
PDF
2005-236 D.Kráľ, R.Škrekovski, M.Tancer
Construction of large graphs with no optimal surjective L(2,1)-labeling
PDF
2005-237 P. Horák, T. Kaiser, M. Rosenfeld, and Z. Ryjáček
The prism over the middle-levels graph is hamiltonian
PDF
2005-238 D. Kráľ, J. Sgall, and T. Tichý
Randomized strategies for the plurality problem
PDF
2005-239 J. Fiala, P. Golovach, and J. Kratochvíl
Distance constrained labelings of graphs of bounded treewidth
PDF
2005-240 M. Bodirsky, D. Kráľ
Locally consistent constraint satisfaction problems with binary constraints
PDF
2005-241 D. Kráľ, L.-D. Tong, X. Zhu
Upper Hamiltonian numbers and Hamiltonian spectra of graphs
PDF
2005-242 J. Nešetřil, R. Šámal
Tension continuous maps - their structure and applications
PDF
2005-243 Z. Dvořák, D. Kráľ, P. Nejedlý, R. Škrekovski
Coloring squares of planar graphs with no short cycles
PDF
2005-244 M. Bodirsky, J. Nešetřil
Constraint satisfaction with countable homogeneous templates
PDF
2005-245 P. Pudlák
On explicit Ramsey graphs and estimates of the number of sums and products
PDF
2005-246 D. Kráľ (ed.)
Soucasne trendy teoreticke informatiky
PDF
2005-247 J. Nešetřil, I. Švejdarová
Diameters of duals are linear
PDF
2005-248 D. Piguet, M. Stein
The Loebl conjecture for trees of small diameter
PDF
2005-249 M. Klazar, F. Luca
On the maximal order of numbers in the factorisatio numerorum problem
PDF
2005-250 T. Chudlarský (ed.)
First Czech-Catalan Conference in Mathematics
PDF
2005-251 M. Klazar
On identities concerning the number of crossings and nestings of two edges in matchings
PDF
2005-252 M. Ghebleh, D. Kráľ, S. Norine, R. Thomas
The circular chromatic index of the flower snarks
PDF
2005-253 J. Nešetřil, P. Ossona de Mendez
The grad of a graph and classes with bounded expansion
PDF
2005-254 V. Janota (ed.)
XML Prague - a conference on XML
PDF
2005-255 Z. Dvořák, R. Škrekovski, M. Tancer
List-colouring squares of sparse subcubic graphs
PDF
2005-256 R. N. Ball, A. Pultr, P. Vojtěchovský
Colored graphs without colorful cycles
PDF
2005-257 J. Kára, J. Kratochvíl, D. R. Wood
On the complexity of the balanced vertex ordering problem
PDF
2005-258 J. Fiala, J. Kratochvíl
On the computational complexity of the L(2,1)-labeling problem for regular graphs
PDF
2005-259 J. Fiala, J. Kratochvíl, A. Pór
On the computational complexity of partial covers of Theta graphs
PDF
2005-260 T. Valla, J. Matoušek
Kombinatorika a grafy I.
PDF
2005-261 B. M. Landman, M. B. Nathanson, J. Nešetřil, C. Pomerance
Topics in Combinatorial Number Theory, proceedings of the INTEGERS conference 2003 in honor of Tom Brown
2005-262 J. Nešetřil, P. Ossona de Mendez
Grad and Classes with Bounded Expansion I. Decompositions
PDF
2005-263 J. Nešetřil, P. Ossona de Mendez
Grad and Classes with Bounded Expansion II. Algorithmic Aspects
PDF
2005-264 J. Nešetřil, P. Ossona de Mendez
Grad and Classes with Bounded Expansion III. Restricted Graph Homomorphism Dualities
PDF
2005-265 S. Norine, R. Thomas
Pfaffian labelings and signs of edge colorings
PDF
2005-266 S. Norine, R. Thomas
Minimal bricks
2005-267 M. Bodirsky, J. Kára
The complexity of equality constraint languages
PDF
2005-268 R. Naserasr, Y. Nigussie, R. Škrekovski
Homomorphisms of triangle-free graphs without a K[5]-minor
PDF
2005-269 T. Kaiser
A note on interconnecting matchings in graphs
PDF
2005-270 T. Kaiser
Disjoint T-paths in tough graphs
PDF
2005-271 J. Černý
A simple proof for open cups and caps
PDF
2005-272 T. Kaiser, D. Kráľ, L. Stacho
Tough spiders
PDF
2005-273 T. Kaiser, R. Škrekovski
T-joins intersecting small edge-cuts in graphs
PDF
2005-274 P. Bella, D. Kráľ, B. Mohar, K. Quittnerová
Labeling planar graphs with a condition at distance two
PDF