Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Discrete mathematics & theoretical computer science
Tome DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005)
Précédent
Suivant
DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Distance graphs with maximum chromatic number
Barajas, Javier
;
Serra, Oriol
Crooked Maps in Finite Fields
Kyureghyan, Gohar
Matroid matching with Dilworth truncation
Makai, Márton
Pebble Game Algorithms and (k,l)-Sparse Graphs
Lee, Audrey
;
Streinu, Ileana
On the Grone-Merris conjecture
Stephen, Tamon
The Windy Postman Problem on Series-Parallel Graphs
Martínez, Francisco Javier Zaragoza
Connected τ -critical hypergraphs of minimal size
Stehlík, Matěj
A characterization of extremal graphs with no matching-cut
Bonsma, Paul
Packing non-returning A-paths algorithmically
Pap, Gyula
Structure of spaces of rhombus tilings in the lexicograhic case
Rémila, Éric
An upper bound for the chromatic number of line graphs
King, Andrew D.
;
Reed, Bruce A.
;
Vetta, Adrian R.
Improper colouring of (random) unit disk graphs
Kang, Ross J.
;
Müller, Tobias
;
Sereni, Jean-Sébastien
$K_{\ell}^{-}$
-factors in graphs
Kühn, Daniela
;
Osthus, Deryk
Mader Tools
Göring, Frank
Multigraph decomposition into multigraphs with two underlying edges
Priesler, Miri
;
Tarsi, Michael
Degree-correlation of Scale-free graphs
Nikoloski, Zoran
;
Deo, Narsingh
;
Kucera, Ludek
Density of universal classes of series-parallel graphs
Nešetřil, Jaroslav
;
Nigussie, Yared
Packing triangles in low degree graphs and indifference graphs
Manić, Gordana
;
Wakabayashi, Yoshiko
Excluded subposets in the Boolean lattice
Katona, Gyula O.H.
Infinite limits and folding
Bonato, Anthony
;
Janssen, Jeannette
Finding a Strong Stable Set or a Meyniel Obstruction in any Graph
Cameron, Kathie
;
Edmonds, Jack
NBC Complexes of Convex Geometries
Kashiwabara, Kenji
;
Nakamura, Masataka
Packing Three-Vertex Paths in a Subcubic Graph
Kosowski, Adrian
;
Malafiejski, Michal
;
Zyliński, Pawel
Largest cliques in connected supermagic graphs
Lladó, Anna
Nonrepetitive colorings of graphs
Alon, Noga
;
Grytczuk, Jaroslaw
On the enumeration of uniquely reducible double designs
Fack, Veerle
;
Topalova, Svetlana
;
Winne, Joost
Labeling planar graphs with a condition at distance two
Bella, Peter
;
Král, Daniel
;
Mohar, Bojan
;
Quittnerová, Katarina
Quadratic LYM-type inequalities for intersecting Sperner families
Bey, Christian
Fast separation in a graph with an excluded minor
Reed, Bruce
;
Wood, David R.
Supermodularity on chains and complexity of maximum constraint satisfaction
Deineko, Vladimir
;
Jonsson, Peter
;
Klasson, Mikael
;
Krokhin, Andrei
Permutations with short monotone subsequences
Romik, Dan
Weak Positional Games on Hypergraphs of Rank Three
Kutz, Martin
Decomposable graphs and definitions with no quantifier alternation
Pikhurko, Oleg
;
Spencer, Joel
;
Verbitsky, Oleg
Hypertree-Width and Related Hypergraph Invariants
Adler, Isolde
;
Gottlob, Georg
;
Grohe, Martin
Monotone Boolean Functions with s Zeros Farthest from Threshold Functions
Amano, Kazuyuki
;
Tarui, Jun
Pairwise Intersections and Forbidden Configurations
Anstee, Richard P.
;
Keevash, Peter
A sufficient condition for bicolorable hypergraphs
Défossez, David
The game of arboricity
Bartnicki, Tomasz
;
Grytczuk, Jaroslaw
;
Kierstead, Hal
Directed One-Trees
Evans, William
;
Safari, Mohammad Ali
Removing Even Crossings
Pelsmajer, Michael J.
;
Schaefer, Marcus
;
Štefankovič, Daniel
On the 3/4-Conjecture for Fix-Free Codes
Deppe, Christian
;
Schnettler, Holger
Color critical hypergraphs and forbidden configurations
Anstee, Richard
;
Fleming, Balin
;
Füredi, Zoltán
;
Sali, Attila
Minor-monotone crossing number
Bokal, Drago
;
Fijavž, Gašper
;
Mohar, Bojan
Linear choosability of graphs
Esperet, Louis
;
Montassier, Mickael
;
Raspaud, André
Hadamard matrices of order 36 and double-even self-dual [72,36,12] codes
Bouyukliev, Iliya
;
Fack, Veerle
;
Winne, Joost
Deterministic Random Walks on the Integers
Cooper, Joshua
;
Doerr, Benjamin
;
Spencer, Joel
;
Tardos, Gábor
Chromatic Turán problems and a new upper bound for the Turán density of
$\mathcal{K}_4^-$
Talbot, John
On the
$L(p,1)$
-labelling of graphs
Gonçalves, Daniel
Representations of Edge Intersection Graphs of Paths in a Tree
Golumbic, Martin Charles
;
Lipshteyn, Marina
;
Stern, Michal
Colouring random geometric graphs
McDiarmid, Colin J. H.
;
Müller, Tobias
Negative results on acyclic improper colorings
Ochem, Pascal
Spanning paths in hypercubes
Dvořák, Tomáš
;
Gregor, Petr
;
Koubek, Václav
On the Minimum Number of Completely 3-Scrambling Permutations
Tarui, Jun
Hamiltonian Chains in Hypergraphs
Katona, Gyula Y.
Relaxed Two-Coloring of Cubic Graphs
Berke, Robert
;
Szabó, Tibor
Counting Polyominoes on Twisted Cylinders
Barequet, Gill
;
Moffie, Micha
;
Ribó, Ares
;
Rote, Günter
Local chromatic number and topology
Simonyi, Gábor
;
Tardos, Gábor
Hamiltonian cycles in torical lattices
Leontiev, Vladimir K.
Enumeration of walks reaching a line
Nadeau, Philippe
Acyclic Coloring of Graphs of Maximum Degree
$\Delta$
Fertin, Guillaume
;
Raspaud, André
On the number of series parallel and outerplanar graphs
Bodirsky, Manuel
;
Gimenez, Omer
;
Kang, Mihyun
;
Noy, Marc
Every
$3$
-connected, essentially
$11$
-connected line graph is hamiltonian
Lai, Hong-Jian
;
Shao, Yehong
;
Zhou, Ju
;
Wu, Hehui
Maximal sets of integers not containing
$k+1$
pairwise coprimes and having divisors from a specified set of primes
Blinovsky, Vladimir
Balanced Avoidance Games on Random Graphs
Marciniszyn, Martin
;
Mitsche, Dieter
;
Stojaković, Miloš
A Min-Max theorem about the Road Coloring Conjecture
Hegde, Rajneesh
;
Jain, Kamal
Improving the Gilbert-Varshamov bound for
$q$
-ary codes
Vu, Van H.
;
Wu, Lei
Matchings and Hamilton cycles in hypergraphs
Kühn, Daniela
;
Osthus, Deryk
On infinite permutations
Fon-Der-Flaass, Dmitri G.
;
Frid, Anna E.
Random Inscribing Polytopes
Richardson, Ross M.
;
Vu, Van H.
;
Wu, Lei
Equivalent Subgraphs of Order
$3$
Nakamigawa, Tomoki
An extremal problem on trees and database theory
Katona, Gyula O.H.
;
Tichler, Krisztián
On the Frobenius’ Problem of three numbers
Aguiló, Francesc
;
Miralles, Alícia
Discrepancy of Products of Hypergraphs
Doerr, Benjamin
;
Gnewuch, Michael
;
Hebbinghaus, Nils
A Probabilistic Counting Lemma for Complete Graphs
Gerke, Stefanie
;
Marciniszyn, Martin
;
Steger, Angelika
Cycles intersecting edge-cuts of prescribed sizes
Kaiser, Tomáš
;
Škrekovski, Riste
On minimal blocking sets of the generalized quadrangle
$Q(4, q)$
Cimráková, Miroslava
;
Fack, Veerle
Kernel perfect and critical kernel imperfect digraphs structure
Galeana-Sánchez, Hortensia
;
Guevara, Mucuy-Kak