IUUK-CE-ITI series 2006

2006-275 M. Loebl
Lecture Notes on Matroids
PDF
2006-276 M. Loebl
Chromatic polynomial, q-binomial counting and colored Jones function
PDF
2006-277 M. Kiwi, M. Loebl
Distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graph
PDF
2006-278 M. Loebl, L. Zdeborová
The 3D Dimer and Ising Problems Revisited
PDF
2006-279 W. Krauth, M. Loebl
Jamming and geometric representations of graphs
PDF
2006-280 Z. Dvořák, R. Škrekovski, T. Valla
Planar graphs of odd-girth at least 9 are homomorphic to Petersen graph
PDF
2006-281 J. Fiala, D. Paulusma, J.A. Telle
Locally constrained graph homomorphisms and equitable partitions
PDF
2006-282 M. DeVos, R. Šámal
High Girth Cubic Graphs Map to the Clebsch Graph
PDF
2006-283 J. Nešetřil, R. Šámal
On tension-continuous mappings
PDF
2006-284 J. Nešetřil, P. Ossona de Mendez
Linear time low tree-width partitions and algorithmic consequences
PDF
2006-285 J. Foniok, J. Nešetřil, C. Tardif
Generalised Dualities and Finite Maximal Antichains (extended abstract)
PDF
2006-286 J. Foniok, J. Nešetřil, C. Tardif
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
PDF
2006-287 Z. Dvořák
On Recognizing Graphs by Numbers of Homomorphisms
PDF
2006-288 T. Kaiser
Minors of Simplicial Complexes
PDF
2006-289 T. Kaiser, R. Kužel, H. Li, G. Wang
A note on k-walks in bridgeless graphs
PDF
2006-290 R. N. Ball, A. Pultr, J. Sichler
More on Configurations in Priestley Spaces, and Some New Problems
PDF
2006-291
Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications (conference booklet)
2006-292
Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications (abstracts)
2006-293 A. Pultr
Sublocale Sets and Sublocale Lattices
PDF
2006-294 V. Janota (ed.)
XMLPrague: a conference on XML
PDF
2006-295 D. Kráľ, R. Thomas
Coloring even-faced graphs in the torus and the Klein bottle
PDF
2006-296 G. Kun, J. Nešetřil
Forbidden Lifts (NP and CSP for Combinatorists)
PDF
2006-297 P. Kolman, T. Waleń
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
PDF
2006-298 M. Erné, M. Gehrke, A. Pultr
Complete Congruences on Topologies and Down-set Lattices
PDF
2006-299 J. Nešetřil
Homomorphisms of Structures (Concepts and Highlights)
PDF
2006-300 J. Griggs, D. Kráľ
Graph Labellings with Variable Weights, a Survey
PDF
2006-301 V. Müller, J. Nešetřil (eds.)
Jan Pelant (in memoriam)
PDF
2006-302 G. Hegedűs
Balancing Sets of Vectors
PDF
2006-303 G. Hegedűs
An algorithm for two coloring of hypergraphs
PDF
2006-304 G. Hegedűs
Constructive Ramsey theory
PDF
2006-305 G. Hegedűs
Affine subspaces
PDF
2006-306 R. Barták, O. Čepek
A Constraint Model for State Transitions in Disjunctive Resources
PDF
2006-307 M. Bodirsky, J. Kára
Fast Algorithms and Lower Bounds for Temporal Reasoning
PDF
2006-308 M. Bodirsky, D. Kráľ
Locally Consistent Constraint Satisfaction Problems
PDF
2006-309 R. N. Ball, J. Nešetřil, A. Pultr
Dualities in Full Homomorphisms
PDF
2006-310 D. Kráľ
Computing Representations of Matroids of Bounded Branch-Width
PDF
2006-311 J. Matoušek
Lineární programování a lineární algebra pro informatiky
PDF
2006-313 H. Bruhn, J. Černý, A. Hall, P. Kolman
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks
PDF
2006-314 R. Erman, S. Jurečič, D. Kráľ, K. Stopar, N. Stopar
Optimal Real Number Graph Labelings of a Subfamily of Kneser Graphs
PDF
2006-315 J. Fiala, J. Soto
Block Transitivity and Degree Matrices
PDF
2006-316 Z. Dvořák, D. Kráľ, J. Teska
Toughness Threshold for the Existence of 2-walks in K4-minor Free Graphs
PDF
2006-317 P. Hell, J. Nešetřil
On the Density of Trigraph Homomorphisms
PDF
2006-318 D. Kráľ, P. Nejedlý
Distance Constrained Labelings of K4-minor Free Graphs
PDF
2006-319 Z. Dvořák, S. Jendroľ, D. Kráľ
Matchings and Non-rainbow Colorings
PDF
2006-320 T. Kaiser, A. Raspaud
Non-intersecting Perfect Matchings in Cubic Graphs
PDF
2006-321 M. DeVos, L. Goddyn, B. Mohar, R. Šámal
A Quadratic Lower Bound for Subset Sums
PDF
2006-322 B. Lužar, R. Škrekovski, M. Tancer
Injective Coloring of Planar Graphs with Few Colors
PDF
2006-323 T. Müller, J.-S. Sereni
Identifying Codes in (Random) Geometric Networks
PDF
2006-324 Z. Dvořák
On Forbidden Subdivision Characterization of Graph Classes
PDF