| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A counterexample to prism-hamiltonicity of 3-connected planar graphs
|
Špacapan, Simon
|
|
|
146 |
C |
p. 364-371
|
artikel
|
| 2 |
A strengthening of Erdős-Gallai Theorem and proof of Woodall's conjecture
|
Li, Binlong
|
|
|
146 |
C |
p. 76-95
|
artikel
|
| 3 |
Asymptotic density of graphs excluding disconnected minors
|
Kapadia, Rohan
|
|
|
146 |
C |
p. 151-175
|
artikel
|
| 4 |
Corrigendum to “Cycle decompositions of K n and K n − I” [J. Combin. Theory Ser. B 81 (1) (2001) 77–99]
|
Alspach, Brian
|
|
|
146 |
C |
p. 532-533
|
artikel
|
| 5 |
Decompositions into isomorphic rainbow spanning trees
|
Glock, Stefan
|
|
|
146 |
C |
p. 439-484
|
artikel
|
| 6 |
Editorial Board
|
|
|
|
146 |
C |
p. ii
|
artikel
|
| 7 |
Gaps in the cycle spectrum of 3-connected cubic planar graphs
|
Merker, Martin
|
|
|
146 |
C |
p. 68-75
|
artikel
|
| 8 |
Global rigidity of periodic graphs under fixed-lattice representations
|
Kaszanitzky, Viktória E.
|
|
|
146 |
C |
p. 176-218
|
artikel
|
| 9 |
Hedetniemi's conjecture is asymptotically false
|
He, Xiaoyu
|
|
|
146 |
C |
p. 485-494
|
artikel
|
| 10 |
Minimum degree conditions for monochromatic cycle partitioning
|
Korándi, Dániel
|
|
|
146 |
C |
p. 96-123
|
artikel
|
| 11 |
Most Laplacian eigenvalues of a tree are small
|
Jacobs, David P.
|
|
|
146 |
C |
p. 1-33
|
artikel
|
| 12 |
On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs
|
Azarpendar, Soheil
|
|
|
146 |
C |
p. 372-381
|
artikel
|
| 13 |
Progress towards Nash-Williams' conjecture on triangle decompositions
|
Delcourt, Michelle
|
|
|
146 |
C |
p. 382-416
|
artikel
|
| 14 |
Ramsey numbers of path-matchings, covering designs, and 1-cores
|
DeBiasio, Louis
|
|
|
146 |
C |
p. 124-140
|
artikel
|
| 15 |
Relatively small counterexamples to Hedetniemi's conjecture
|
Zhu, Xuding
|
|
|
146 |
C |
p. 141-150
|
artikel
|
| 16 |
Subdivisions of digraphs in tournaments
|
Girão, António
|
|
|
146 |
C |
p. 266-285
|
artikel
|
| 17 |
Tangles and the Stone-Čech compactification of infinite graphs
|
Kurkofka, Jan
|
|
|
146 |
C |
p. 34-60
|
artikel
|
| 18 |
The interval number of a planar graph is at most three
|
Guégan, Guillaume
|
|
|
146 |
C |
p. 61-67
|
artikel
|
| 19 |
The templates for some classes of quaternary matroids
|
Grace, Kevin
|
|
|
146 |
C |
p. 286-363
|
artikel
|
| 20 |
The (theta, wheel)-free graphs Part IV: Induced paths and cycles
|
Radovanović, Marko
|
|
|
146 |
C |
p. 495-531
|
artikel
|
| 21 |
Towards tight(er) bounds for the Excluded Grid Theorem
|
Chuzhoy, Julia
|
|
|
146 |
C |
p. 219-265
|
artikel
|
| 22 |
Two Erdős–Hajnal-type theorems in hypergraphs
|
Amir, Michal
|
|
|
146 |
C |
p. 417-438
|
artikel
|
Tijdschrift beschrijving