Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Combinatorica AND YEAR=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A bound for the number of vertices of a polytope with applications
Alexander Barvinok
Combinatorica
33
(1), 2013, pp. 1-10
Bounds on the number of autotopisms and subsquares of a Latin square
Joshua Browning
,
Douglas S. Stones
,
Ian M. Wanless
Combinatorica
33
(1), 2013, pp. 11-22
Ramsey degrees of boron tree structures
Jakub Jasiński
Combinatorica
33
(1), 2013, pp. 23-44
Quantitative relation between noise sensitivity and influences
Nathan Keller
,
Guy Kindler
Combinatorica
33
(1), 2013, pp. 45-71
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
Alexander A. Sherstov
Combinatorica
33
(1), 2013, pp. 73-96
Decomposing graphs into paths of fixed length
Carsten Thomassen
Combinatorica
33
(1), 2013, pp. 97-123
Ramsey-goodness - And otherwise
Peter Allen
,
Graham Brightwell
,
Jozef Skokan
Combinatorica
33
(2), 2013, pp. 125-160
A characterisation of the planes meeting a non-singular quadric of
PG(4,Q)
in a conic
David K. Butler
Combinatorica
33
(2), 2013, pp. 161-179
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdŏs-Fajtlowicz
Jacob Fox
,
Choongbum Lee
,
Benny Sudakov
Combinatorica
33
(2), 2013, pp. 181-197
Profile polytopes of some classes of families
Dániel Gerbner
Combinatorica
33
(2), 2013, pp. 199-216
Two inverse results
Hamidoune Yahya Ould
Combinatorica
33
(2), 2013, pp. 217-230
Bipartite partial duals and circuits in medial graphs
Stephen Huggett
,
Iain Moffatt
Combinatorica
33
(2), 2013, pp. 231-252
A unified approach to distance-two colouring of graphs on surfaces
Omid Amini
,
Louis Esperet
,
Jan Van Den Heuvel
Combinatorica
33
(3), 2013, pp. 253-296
On the theta number of powers of cycle graphs
Christine Bachoc
,
Arnaud Pêcher
,
Alain Thiéry
Combinatorica
33
(3), 2013, pp. 297-317
Circumference, chromatic number and online coloring
Ajit A. Diwan
,
Sreyash Kenkre
,
Sundar Vishwanathan
Combinatorica
33
(3), 2013, pp. 319-334
Constraints, MMSNP and expander relational structures
Gábor Kun
Combinatorica
33
(3), 2013, pp. 335-347
Pathwidth, trees, and random embeddings
James R. Lee
,
Anastasios Sidiropoulos
Combinatorica
33
(3), 2013, pp. 349-374
Finite basis for analytic strong
n
-gaps
Antonio Avilées
,
Stevo Todorcevic
Combinatorica
33
(4), 2013, pp. 375-393
Long paths and cycles in subgraphs of the cube
Eoin Long
Combinatorica
33
(4), 2013, pp. 395-428
Diameters of random circulant graphs
Jens Marklof
,
Andreas Strömbergsson
Combinatorica
33
(4), 2013, pp. 429-466
Local chromatic number of quadrangulations of surfaces
Bojan Mohar
,
Gábor Simonyi
,
Gábor Tardos
Combinatorica
33
(4), 2013, pp. 467-494
Critical graphs without triangles: An optimum density construction
Wesley Pegden
Combinatorica
33
(4), 2013, pp. 495-512
Chromatic number and complete graph substructures for degree sequences
Zdenȇk Dvoȓák
,
Bojan Mohar
Combinatorica
33
(5), 2013, pp. 513-529
On the density of triangles and squares in regular finite and unimodular random graphs
Viktor Harangi
Combinatorica
33
(5), 2013, pp. 531-548
Half-integral packing of odd cycles through prescribed vertices
Naonori Kakimura
,
Ken-Ichi Kawarabayashi
Combinatorica
33
(5), 2013, pp. 549-572
Seiten 1
2
>