| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
|
Kivva, Bohdan
|
|
|
151 |
C |
p. 339-374
|
artikel
|
| 2 |
A proof of the upper matching conjecture for large graphs
|
Davies, Ewan
|
|
|
151 |
C |
p. 393-416
|
artikel
|
| 3 |
Corrigendum to “A local epsilon version of Reed's Conjecture” [J. Combin. Theory Ser. B 141 (2020) 181–222]
|
Kelly, Tom
|
|
|
151 |
C |
p. 509-512
|
artikel
|
| 4 |
Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza
|
Czabarka, Éva
|
|
|
151 |
C |
p. 38-45
|
artikel
|
| 5 |
Editorial Board
|
|
|
|
151 |
C |
p. ii
|
artikel
|
| 6 |
Enlarging vertex-flames in countable digraphs
|
Erde, Joshua
|
|
|
151 |
C |
p. 263-281
|
artikel
|
| 7 |
Erdős-Hajnal for cap-free graphs
|
Chudnovsky, Maria
|
|
|
151 |
C |
p. 417-434
|
artikel
|
| 8 |
Erdős-Hajnal-type results for monotone paths
|
Pach, János
|
|
|
151 |
C |
p. 21-37
|
artikel
|
| 9 |
Isomorphic bisections of cubic graphs
|
Das, S.
|
|
|
151 |
C |
p. 465-481
|
artikel
|
| 10 |
Maker-breaker percolation games II: Escaping to infinity
|
Nicholas Day, A.
|
|
|
151 |
C |
p. 482-508
|
artikel
|
| 11 |
Many cliques with few edges and bounded maximum degree
|
Chakraborti, Debsoumya
|
|
|
151 |
C |
p. 1-20
|
artikel
|
| 12 |
On edge-primitive 3-arc-transitive graphs
|
Giudici, Michael
|
|
|
151 |
C |
p. 282-306
|
artikel
|
| 13 |
On the cop number of toroidal graphs
|
Lehner, Florian
|
|
|
151 |
C |
p. 250-262
|
artikel
|
| 14 |
On the intersection conjecture for infinite trees of matroids
|
Bowler, Nathan
|
|
|
151 |
C |
p. 46-82
|
artikel
|
| 15 |
On the lower bound of the sum of the algebraic connectivity of a graph and its complement
|
Einollahzadeh, Mostafa
|
|
|
151 |
C |
p. 235-249
|
artikel
|
| 16 |
On the spectrum of Hamiltonian cycles in the n-cube
|
Perezhogin, A.L.
|
|
|
151 |
C |
p. 435-464
|
artikel
|
| 17 |
On the unavoidability of oriented trees
|
Dross, François
|
|
|
151 |
C |
p. 83-110
|
artikel
|
| 18 |
Packing and covering immersions in 4-edge-connected graphs
|
Liu, Chun-Hung
|
|
|
151 |
C |
p. 148-222
|
artikel
|
| 19 |
Polynomial bounds for centered colorings on proper minor-closed graph classes
|
Pilipczuk, Michał
|
|
|
151 |
C |
p. 111-147
|
artikel
|
| 20 |
The Farey graph is uniquely determined by its connectivity
|
Kurkofka, Jan
|
|
|
151 |
C |
p. 223-234
|
artikel
|
| 21 |
The inverse Kazhdan-Lusztig polynomial of a matroid
|
Gao, Alice L.L.
|
|
|
151 |
C |
p. 375-392
|
artikel
|
| 22 |
Unavoidable hypergraphs
|
Bucić, Matija
|
|
|
151 |
C |
p. 307-338
|
artikel
|
Tijdschrift beschrijving