nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A large number of m-coloured complete infinite subgraphs
|
Girão, António |
|
|
142 |
C |
p. 80-105 |
artikel |
2 |
A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
|
Altman, Daniel |
|
|
142 |
C |
p. 307-373 |
artikel |
3 |
Corrigendum to “Bisimplicial vertices in even-hole-free graphs”
|
Addario-Berry, Louigi |
|
|
142 |
C |
p. 374-375 |
artikel |
4 |
Cuboids, a class of clutters
|
Abdi, Ahmad |
|
|
142 |
C |
p. 144-209 |
artikel |
5 |
Editorial Board
|
|
|
|
142 |
C |
p. ii |
artikel |
6 |
Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture
|
Scott, Alex |
|
|
142 |
C |
p. 43-55 |
artikel |
7 |
k-regular subgraphs near the k-core threshold of a random graph
|
Mitsche, Dieter |
|
|
142 |
C |
p. 106-143 |
artikel |
8 |
Matroid fragility and relaxations of circuit hyperplanes
|
Geelen, Jim |
|
|
142 |
C |
p. 36-42 |
artikel |
9 |
On the existence of graphical Frobenius representations and their asymptotic enumeration
|
Spiga, Pablo |
|
|
142 |
C |
p. 210-243 |
artikel |
10 |
Ranking tournaments with no errors II: Minimax relation
|
Chen, Xujin |
|
|
142 |
C |
p. 244-275 |
artikel |
11 |
Simple k-planar graphs are simple (k + 1)-quasiplanar
|
Angelini, Patrizio |
|
|
142 |
C |
p. 1-35 |
artikel |
12 |
The inverse eigenvalue problem of a graph: Multiplicities and minors
|
Barrett, Wayne |
|
|
142 |
C |
p. 276-306 |
artikel |
13 |
Towards the linear arboricity conjecture
|
Ferber, Asaf |
|
|
142 |
C |
p. 56-79 |
artikel |