| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An analogue of the Erdős–Gallai theorem for random graphs
|
Balogh, József
|
|
|
91 |
C |
p.
|
artikel
|
| 2 |
Bounding the number of cycles in a graph in terms of its degree sequence
|
Dvořák, Zdeněk
|
|
|
91 |
C |
p.
|
artikel
|
| 3 |
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth
|
Nešetřil, Jaroslav
|
|
|
91 |
C |
p.
|
artikel
|
| 4 |
Concepts of signed graph coloring
|
Steffen, Eckhard
|
|
|
91 |
C |
p.
|
artikel
|
| 5 |
2-connected chordal graphs and line graphs are ( 1 , 5 ) -choosable
|
Wong, Tsai-Lien
|
|
|
91 |
C |
p.
|
artikel
|
| 6 |
Distance-two colourings of Barnette graphs
|
Feder, Tomás
|
|
|
91 |
C |
p.
|
artikel
|
| 7 |
Editorial Board
|
|
|
|
91 |
C |
p.
|
artikel
|
| 8 |
Foreword
|
Fiala, Jiří
|
|
|
91 |
C |
p.
|
artikel
|
| 9 |
From the 1-2-3 conjecture to the Riemann hypothesis
|
Grytczuk, Jarosław
|
|
|
91 |
C |
p.
|
artikel
|
| 10 |
Homomorphisms of signed graphs: An update
|
Naserasr, Reza
|
|
|
91 |
C |
p.
|
artikel
|
| 11 |
( k , l ) -colourings and Ferrers diagram representations of cographs
|
Epple, Dennis D.A.
|
|
|
91 |
C |
p.
|
artikel
|
| 12 |
Odd decompositions and coverings of graphs
|
Petruševski, Mirko
|
|
|
91 |
C |
p.
|
artikel
|
| 13 |
On circular-perfect graphs: A survey
|
Pêcher, Arnaud
|
|
|
91 |
C |
p.
|
artikel
|
| 14 |
On 2-defective DP-colorings of sparse graphs
|
Kostochka, Alexandr
|
|
|
91 |
C |
p.
|
artikel
|
| 15 |
On induced saturation for paths
|
Cho, Eun-Kyung
|
|
|
91 |
C |
p.
|
artikel
|
| 16 |
On-line partitioning of width w posets into w O ( log log w ) chains
|
Bosek, Bartłomiej
|
|
|
91 |
C |
p.
|
artikel
|
| 17 |
On subgroup perfect codes in Cayley graphs
|
Zhang, Junyang
|
|
|
91 |
C |
p.
|
artikel
|
| 18 |
On the 4-color theorem for signed graphs
|
Kardoš, František
|
|
|
91 |
C |
p.
|
artikel
|
| 19 |
Optimal radio- k -labelings of trees
|
Chavez, Angel
|
|
|
91 |
C |
p.
|
artikel
|
| 20 |
Packing branchings under cardinality constraints on their root sets
|
Gao, Hui
|
|
|
91 |
C |
p.
|
artikel
|
| 21 |
Probabilistic zero forcing on random graphs
|
English, Sean
|
|
|
91 |
C |
p.
|
artikel
|
| 22 |
Random hypergraphs and property B
|
Duraj, Lech
|
|
|
91 |
C |
p.
|
artikel
|
| 23 |
3-regular graphs are 2-reconstructible
|
Kostochka, Alexandr V.
|
|
|
91 |
C |
p.
|
artikel
|
| 24 |
r -hued ( r + 1 ) -coloring of planar graphs with girth at least 8 for r ≥ 9
|
La, Hoang
|
|
|
91 |
C |
p.
|
artikel
|
| 25 |
Signed Euler–Mahonian identities
|
Eu, Sen-Peng
|
|
|
91 |
C |
p.
|
artikel
|
| 26 |
Stable structure on safe set problems in vertex-weighted graphs
|
Fujita, Shinya
|
|
|
91 |
C |
p.
|
artikel
|
| 27 |
Superposition of snarks revisited
|
Máčajová, Edita
|
|
|
91 |
C |
p.
|
artikel
|
| 28 |
The domination number of the graph defined by two levels of the n -cube, II
|
Balogh, József
|
|
|
91 |
C |
p.
|
artikel
|
| 29 |
The last temptation of William T. Tutte
|
Mohar, Bojan
|
|
|
91 |
C |
p.
|
artikel
|
| 30 |
Uniform orderings for generalized coloring numbers
|
van den Heuvel, Jan
|
|
|
91 |
C |
p.
|
artikel
|
Tijdschrift beschrijving