| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Almost-Fisher families
|
Das, Shagnik
|
|
2015
|
49 |
C |
p. 293-300
8 p.
|
artikel
|
| 2 |
Almost-spanning universality in random graphs (Extended abstract)
|
Conlon, David
|
|
2015
|
49 |
C |
p. 203-211
9 p.
|
artikel
|
| 3 |
An application of Combinatorics in Cryptography
|
Horak, Peter
|
|
2015
|
49 |
C |
p. 31-35
5 p.
|
artikel
|
| 4 |
An extension of the Bollobás-Riordan polynomial for vertex partitioned ribbon graphs: definition and universality
|
Krajewski, Thomas
|
|
2015
|
49 |
C |
p. 285-292
8 p.
|
artikel
|
| 5 |
An Improved Upper Bound on the Growth Constant of Polyominoes
|
Barequet, Gill
|
|
2015
|
49 |
C |
p. 167-172
6 p.
|
artikel
|
| 6 |
An universality argument for graph homomorphisms
|
Fiala, Jiří
|
|
2015
|
49 |
C |
p. 643-649
7 p.
|
artikel
|
| 7 |
A rainbow Erdős-Rothschild problem
|
Hoppen, Carlos
|
|
2015
|
49 |
C |
p. 473-480
8 p.
|
artikel
|
| 8 |
A random triadic process
|
Korándi, Dániel
|
|
2015
|
49 |
C |
p. 189-196
8 p.
|
artikel
|
| 9 |
Arithmetic progressions with a pseudorandom step
|
Aigner-Horev, Elad
|
|
2015
|
49 |
C |
p. 447-455
9 p.
|
artikel
|
| 10 |
A SAT attack on the Erdős–Szekeres conjecture
|
Balko, Martin
|
|
2015
|
49 |
C |
p. 425-431
7 p.
|
artikel
|
| 11 |
A sharp bound on the number of maximal sum-free sets
|
Balogh, József
|
|
2015
|
49 |
C |
p. 57-64
8 p.
|
artikel
|
| 12 |
A simple removal lemma for large nearly-intersecting families
|
Tran, Tuan
|
|
2015
|
49 |
C |
p. 93-99
7 p.
|
artikel
|
| 13 |
A stronger bound for the strong chromatic index
|
Bruhn, Henning
|
|
2015
|
49 |
C |
p. 277-284
8 p.
|
artikel
|
| 14 |
Asymmetric Coloring Games on Incomparability Graphs
|
Krawczyk, Tomasz
|
|
2015
|
49 |
C |
p. 803-811
9 p.
|
artikel
|
| 15 |
Automatic Proofs for Formulae Enumerating Proper Polycubes
|
Barequet, Gill
|
|
2015
|
49 |
C |
p. 145-151
7 p.
|
artikel
|
| 16 |
Bipartite Kneser graphs are Hamiltonian
|
Mütze, Torsten
|
|
2015
|
49 |
C |
p. 259-267
9 p.
|
artikel
|
| 17 |
Bipartitions of highly connected tournaments
|
Kim, Jaehoon
|
|
2015
|
49 |
C |
p. 79-84
6 p.
|
artikel
|
| 18 |
Bootstrap percolation in random k-uniform hypergraphs
|
Kang, Mihyun
|
|
2015
|
49 |
C |
p. 595-601
7 p.
|
artikel
|
| 19 |
Bounded face-width forces K 7-minors in orientable surfaces
|
Fijavž, Gašper
|
|
2015
|
49 |
C |
p. 399-406
8 p.
|
artikel
|
| 20 |
Bounding the Clique-Width of H-free Split Graphs
|
Brandstädt, Andreas
|
|
2015
|
49 |
C |
p. 497-503
7 p.
|
artikel
|
| 21 |
Characterisation of symmetries of unlabelled triangulations
|
Kang, M.
|
|
2015
|
49 |
C |
p. 587-594
8 p.
|
artikel
|
| 22 |
Classifying partial Latin rectangles
|
Falcón, Raúl M.
|
|
2015
|
49 |
C |
p. 765-771
7 p.
|
artikel
|
| 23 |
4-colorability of P 6-free graphs
|
Brause, Christoph
|
|
2015
|
49 |
C |
p. 37-42
6 p.
|
artikel
|
| 24 |
Colorings of hypergraphs with large number of colors
|
Akolzin, Ilia
|
|
2015
|
49 |
C |
p. 407-411
5 p.
|
artikel
|
| 25 |
Completion and decomposition of hypergraphs into dominating sets of graphs
|
Martí-Farré, Jaume
|
|
2015
|
49 |
C |
p. 213-220
8 p.
|
artikel
|
| 26 |
Counting configuration–free sets in groups
|
Rué, Juanjo
|
|
2015
|
49 |
C |
p. 549-557
9 p.
|
artikel
|
| 27 |
Counting in hypergraphs via regularity inheritance
|
Davies, Ewan
|
|
2015
|
49 |
C |
p. 413-417
5 p.
|
artikel
|
| 28 |
Cycles and matchings in randomly perturbed digraphs and hypergraphs
|
Krivelevich, Michael
|
|
2015
|
49 |
C |
p. 181-187
7 p.
|
artikel
|
| 29 |
Decomposing series-parallel graphs into paths of length 3 and triangles
|
Merker, Martin
|
|
2015
|
49 |
C |
p. 367-370
4 p.
|
artikel
|
| 30 |
Decomposition of bi-colored square arrays into balanced diagonals
|
Kotlar, Dani
|
|
2015
|
49 |
C |
p. 17-22
6 p.
|
artikel
|
| 31 |
Decompositions of highly connected graphs into paths of any given length
|
Botler, F.
|
|
2015
|
49 |
C |
p. 795-802
8 p.
|
artikel
|
| 32 |
Drawing a disconnected graph on the torus (Extended abstract)
|
Cabello, Sergio
|
|
2015
|
49 |
C |
p. 779-786
8 p.
|
artikel
|
| 33 |
Edge-decompositions of graphs with high minimum degree
|
Barber, Ben
|
|
2015
|
49 |
C |
p. 115-121
7 p.
|
artikel
|
| 34 |
Enumeration of cubic multigraphs on orientable surfaces
|
Kang, M.
|
|
2015
|
49 |
C |
p. 603-610
8 p.
|
artikel
|
| 35 |
Equitable colorings of non-uniform simple hypergraphs
|
Shirgazina, Irina
|
|
2015
|
49 |
C |
p. 699-703
5 p.
|
artikel
|
| 36 |
Even pairs in square-free Berge graphs
|
Maffray, Frédéric
|
|
2015
|
49 |
C |
p. 173-180
8 p.
|
artikel
|
| 37 |
Evolution of high-order connected components in random hypergraphs
|
Cooley, Oliver
|
|
2015
|
49 |
C |
p. 569-575
7 p.
|
artikel
|
| 38 |
Extremal problems for colorings of simple hypergraphs and applications
|
Kozik, Jakub
|
|
2015
|
49 |
C |
p. 441-445
5 p.
|
artikel
|
| 39 |
Finding a majority ball with majority answers
|
Vizer, Máté
|
|
2015
|
49 |
C |
p. 345-351
7 p.
|
artikel
|
| 40 |
First non-trivial upper bound on circular chromatic number of the plane
|
Junosza-Szaniawski, Konstanty
|
|
2015
|
49 |
C |
p. 719-722
4 p.
|
artikel
|
| 41 |
Graph Cores via Universal Completability
|
Godsil, Chris
|
|
2015
|
49 |
C |
p. 337-344
8 p.
|
artikel
|
| 42 |
Guarding Polyominoes, Polycubes and Polyhypercubes
|
Pinciu, Val
|
|
2015
|
49 |
C |
p. 159-166
8 p.
|
artikel
|
| 43 |
Hardness of computing width parameters based on branch decompositions over the vertex set
|
Sæther, Sigve Hortemo
|
|
2015
|
49 |
C |
p. 301-308
8 p.
|
artikel
|
| 44 |
Harmonious and achromatic colorings of fragmentable hypergraphs
|
Dębski, Michał
|
|
2015
|
49 |
C |
p. 309-314
6 p.
|
artikel
|
| 45 |
How does the core sit inside the mantle?
|
Coja-Oghlan, Amin
|
|
2015
|
49 |
C |
p. 489-496
8 p.
|
artikel
|
| 46 |
Induced minors and well-quasi-ordering
|
Błasiok, Jarosław
|
|
2015
|
49 |
C |
p. 197-201
5 p.
|
artikel
|
| 47 |
Jacobsthal numbers in generalised Petersen graphs
|
Bruhn, Henning
|
|
2015
|
49 |
C |
p. 465-472
8 p.
|
artikel
|
| 48 |
Kempe Equivalence of Colourings of Cubic Graphs
|
Feghali, Carl
|
|
2015
|
49 |
C |
p. 243-249
7 p.
|
artikel
|
| 49 |
Large unavoidable subtournaments
|
Long, Eoin
|
|
2015
|
49 |
C |
p. 723-728
6 p.
|
artikel
|
| 50 |
Limits of some combinatorial problems
|
Csóka, Endre
|
|
2015
|
49 |
C |
p. 577-581
5 p.
|
artikel
|
| 51 |
Local colourings and monochromatic partitions in complete bipartite graphs
|
Lang, Richard
|
|
2015
|
49 |
C |
p. 757-763
7 p.
|
artikel
|
| 52 |
Local resilience of spanning subgraphs in sparse random graphs
|
Allen, Peter
|
|
2015
|
49 |
C |
p. 513-521
9 p.
|
artikel
|
| 53 |
Many T copies in H-free graphs
|
Alon, Noga
|
|
2015
|
49 |
C |
p. 683-689
7 p.
|
artikel
|
| 54 |
Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
|
Clemens, Dennis
|
|
2015
|
49 |
C |
p. 23-30
8 p.
|
artikel
|
| 55 |
Nowhere-zero 5-flows
|
Steffen, Eckhard
|
|
2015
|
49 |
C |
p. 51-55
5 p.
|
artikel
|
| 56 |
On a degree sequence analogue of Pósa's conjecture
|
Staden, Katherine
|
|
2015
|
49 |
C |
p. 233-241
9 p.
|
artikel
|
| 57 |
On a Ramsey-type problem of Erdős and Pach
|
Kang, Ross J.
|
|
2015
|
49 |
C |
p. 821-827
7 p.
|
artikel
|
| 58 |
On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width
|
Fernandes, Cristina G.
|
|
2015
|
49 |
C |
p. 481-488
8 p.
|
artikel
|
| 59 |
On non-traceable, non-hypotraceable, arachnoid graphs
|
Wiener, Gábor
|
|
2015
|
49 |
C |
p. 621-627
7 p.
|
artikel
|
| 60 |
On Spanning Structures in Random Hypergraphs
|
Parczyk, O.
|
|
2015
|
49 |
C |
p. 611-619
9 p.
|
artikel
|
| 61 |
On the Computational Complexity and Strategies of Online Ramsey Theory
|
Dvořák, Pavel
|
|
2015
|
49 |
C |
p. 729-736
8 p.
|
artikel
|
| 62 |
On the generalised colouring numbers of graphs that exclude a fixed minor
|
van den Heuvel, Jan
|
|
2015
|
49 |
C |
p. 523-530
8 p.
|
artikel
|
| 63 |
On the graph limit question of Vera T. Sós
|
Csóka, Endre
|
|
2015
|
49 |
C |
p. 583-586
4 p.
|
artikel
|
| 64 |
On the Minimum Edge-Density of 5-Critical Triangle-Free Graphs
|
Postle, Luke
|
|
2015
|
49 |
C |
p. 667-673
7 p.
|
artikel
|
| 65 |
On the random greedy F-free hypergraph process
|
Kühn, Daniela
|
|
2015
|
49 |
C |
p. 73-77
5 p.
|
artikel
|
| 66 |
On the zone of a circle in an arrangement of lines
|
Nivasch, Gabriel
|
|
2015
|
49 |
C |
p. 221-231
11 p.
|
artikel
|
| 67 |
Optimal path and cycle decompositions of dense quasirandom graphs
|
Glock, Stefan
|
|
2015
|
49 |
C |
p. 65-72
8 p.
|
artikel
|
| 68 |
Packing, Counting and Covering Hamilton cycles in random directed graphs
|
Ferber, Asaf
|
|
2015
|
49 |
C |
p. 813-819
7 p.
|
artikel
|
| 69 |
Packing minor closed families of graphs
|
Messuti, Silvia
|
|
2015
|
49 |
C |
p. 651-659
9 p.
|
artikel
|
| 70 |
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
|
Dross, Franois
|
|
2015
|
49 |
C |
p. 269-275
7 p.
|
artikel
|
| 71 |
Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles
|
Lang, Richard
|
|
2015
|
49 |
C |
p. 787-794
8 p.
|
artikel
|
| 72 |
Partitioning H-minor free graphs into three subgraphs with no large components
|
Liu, Chun-Hung
|
|
2015
|
49 |
C |
p. 133-138
6 p.
|
artikel
|
| 73 |
Path decompositions of regular graphs with prescribed girth
|
Botler, F.
|
|
2015
|
49 |
C |
p. 629-636
8 p.
|
artikel
|
| 74 |
Permutations without long or short cycles
|
Manstavičius, Eugenijus
|
|
2015
|
49 |
C |
p. 153-158
6 p.
|
artikel
|
| 75 |
Preface
|
Nešetřil, Jaroslav
|
|
2015
|
49 |
C |
p. 1-2
2 p.
|
artikel
|
| 76 |
Properly colored and rainbow copies of graphs with few cherries
|
Sudakov, Benny
|
|
2015
|
49 |
C |
p. 315-321
7 p.
|
artikel
|
| 77 |
Rainbow matchings and algebras of sets
|
Nivasch, Gabriel
|
|
2015
|
49 |
C |
p. 251-257
7 p.
|
artikel
|
| 78 |
Rainbow matchings and connectedness of coloured graphs
|
Pokrovskiy, Alexey
|
|
2015
|
49 |
C |
p. 371-376
6 p.
|
artikel
|
| 79 |
Ramsey classes with forbidden homomorphisms and a closure
|
Hubička, Jan
|
|
2015
|
49 |
C |
p. 737-745
9 p.
|
artikel
|
| 80 |
Ramsey numbers of ordered graphs
|
Balko, Martin
|
|
2015
|
49 |
C |
p. 419-424
6 p.
|
artikel
|
| 81 |
Ramsey Numbers of Squares of Paths
|
Allen, Peter
|
|
2015
|
49 |
C |
p. 637-641
5 p.
|
artikel
|
| 82 |
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality
|
Bodlaender, Hans L.
|
|
2015
|
49 |
C |
p. 559-568
10 p.
|
artikel
|
| 83 |
Regularity lemmas in a Banach space setting
|
Regts, Guus
|
|
2015
|
49 |
C |
p. 107-113
7 p.
|
artikel
|
| 84 |
Regular slices for hypergraphs
|
Allen, Peter
|
|
2015
|
49 |
C |
p. 691-698
8 p.
|
artikel
|
| 85 |
Some Remarks on Rainbow Connectivity
|
Kamčev, Nina
|
|
2015
|
49 |
C |
p. 123-131
9 p.
|
artikel
|
| 86 |
Strong edge coloring sparse graphs
|
Bensmail, Julien
|
|
2015
|
49 |
C |
p. 773-778
6 p.
|
artikel
|
| 87 |
Strong Turán stability
|
Tyomkyn, Mykhaylo
|
|
2015
|
49 |
C |
p. 433-440
8 p.
|
artikel
|
| 88 |
Structural Limits and Approximations of Mappings
|
Nešetřil, Jaroslav
|
|
2015
|
49 |
C |
p. 531-539
9 p.
|
artikel
|
| 89 |
Structural Results for General Partition, Equistable and Triangle graphs
|
Cerioli, Márcia R.
|
|
2015
|
49 |
C |
p. 713-718
6 p.
|
artikel
|
| 90 |
Sudoku Rectangle Completion (Extended Abstract)
|
Mahdian, Mohammad
|
|
2015
|
49 |
C |
p. 747-755
9 p.
|
artikel
|
| 91 |
The Bruhat order on conjugation-invariant sets of involutions in the symmetric group
|
Hansson, Mikael
|
|
2015
|
49 |
C |
p. 3-10
8 p.
|
artikel
|
| 92 |
The Circuit Diameter of the Klee-Walkup Polyhedron
|
Stephen, Tamon
|
|
2015
|
49 |
C |
p. 505-512
8 p.
|
artikel
|
| 93 |
The Diameter of Cyclic Kautz Digraphs
|
Böhmová, K.
|
|
2015
|
49 |
C |
p. 323-330
8 p.
|
artikel
|
| 94 |
The Maximum Independent Set Problem in Subclasses of S i , j , k -Free Graphs
|
Lê, Ngoc C.
|
|
2015
|
49 |
C |
p. 43-49
7 p.
|
artikel
|
| 95 |
The Multicolour Ramsey Number of a Long Odd Cycle
|
Jenssen, Matthew
|
|
2015
|
49 |
C |
p. 377-381
5 p.
|
artikel
|
| 96 |
The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues
|
Fiol, M.A.
|
|
2015
|
49 |
C |
p. 457-463
7 p.
|
artikel
|
| 97 |
Third case of the Cyclic Coloring Conjecture
|
Hebdige, Michael
|
|
2015
|
49 |
C |
p. 11-15
5 p.
|
artikel
|
| 98 |
Tight Cycles in Hypergraphs
|
Allen, P.
|
|
2015
|
49 |
C |
p. 675-682
8 p.
|
artikel
|
| 99 |
10-tough chordal graphs are hamiltonian (Extended Abstract)
|
Kabela, Adam
|
|
2015
|
49 |
C |
p. 331-336
6 p.
|
artikel
|
| 100 |
Towards a flow theory for the dichromatic number
|
Hochstättler, Winfried
|
|
2015
|
49 |
C |
p. 101-106
6 p.
|
artikel
|
| 101 |
Triangle-Free Subgraphs of Random Graphs
|
Allen, Peter
|
|
2015
|
49 |
C |
p. 393-397
5 p.
|
artikel
|
| 102 |
Triangle-free subgraphs with large fractional chromatic number
|
Mohar, Bojan
|
|
2015
|
49 |
C |
p. 661-666
6 p.
|
artikel
|
| 103 |
Triangles in random cubic planar graphs
|
Requilé, Clément
|
|
2015
|
49 |
C |
p. 383-391
9 p.
|
artikel
|
| 104 |
Uniform Linear Embeddings of Spatial Random Graphs
|
Chuangpishit, H.
|
|
2015
|
49 |
C |
p. 541-547
7 p.
|
artikel
|
| 105 |
Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs
|
Taranenko, Anna
|
|
2015
|
49 |
C |
p. 85-92
8 p.
|
artikel
|
| 106 |
Vertex-disjoint subgraphs with high degree sums
|
Chiba, Shuya
|
|
2015
|
49 |
C |
p. 359-366
8 p.
|
artikel
|
| 107 |
Weak regularity and finitely forcible graph limits
|
Cooper, Jacob W.
|
|
2015
|
49 |
C |
p. 139-143
5 p.
|
artikel
|
| 108 |
What Graphs are 2-Dot Product Graphs?
|
Johnson, Matthew
|
|
2015
|
49 |
C |
p. 705-711
7 p.
|
artikel
|
| 109 |
Winning fast in fair biased Maker-Breaker games
|
Clemens, Dennis
|
|
2015
|
49 |
C |
p. 353-358
6 p.
|
artikel
|
Tijdschrift beschrijving