| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A simple algorithm and min–max formula for the inverse arborescence problem
|
Frank, András
|
|
|
295 |
C |
p. 85-93
|
artikel
|
| 2 |
Binary set systems and totally balanced hypergraphs
|
Châtel, Célia
|
|
|
295 |
C |
p. 120-133
|
artikel
|
| 3 |
Cops and an Insightful Robber
|
Huggan, Melissa A.
|
|
|
295 |
C |
p. 112-119
|
artikel
|
| 4 |
Counting Candy Crush configurations
|
Hamilton, Adam
|
|
|
295 |
C |
p. 47-56
|
artikel
|
| 5 |
Editorial Board
|
|
|
|
295 |
C |
p. ii
|
artikel
|
| 6 |
Fibonacci-run graphs I: Basic properties
|
Eğecioğlu, Ömer
|
|
|
295 |
C |
p. 70-84
|
artikel
|
| 7 |
General sum-connectivity index of unicyclic graphs with given diameter
|
Alfuraidan, Monther Rashed
|
|
|
295 |
C |
p. 39-46
|
artikel
|
| 8 |
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
|
Atminas, A.
|
|
|
295 |
C |
p. 57-69
|
artikel
|
| 9 |
Minimum augmented Zagreb index of c -cyclic graphs
|
Liu, Muhuo
|
|
|
295 |
C |
p. 32-38
|
artikel
|
| 10 |
On a conjecture of Schweser and Stiebitz
|
Liu, Muhuo
|
|
|
295 |
C |
p. 25-31
|
artikel
|
| 11 |
On the eigenvalues of eccentricity matrix of graphs
|
Lei, Xingyu
|
|
|
295 |
C |
p. 134-147
|
artikel
|
| 12 |
Polynomially determining spanning connectivity of locally connected line graphs
|
Xiong, Wei
|
|
|
295 |
C |
p. 102-111
|
artikel
|
| 13 |
Upper bounds for the M D -numbers and characterization of extremal graphs
|
Li, Ping
|
|
|
295 |
C |
p. 1-12
|
artikel
|
| 14 |
Vertex-degree based topological indices of digraphs
|
Monsalve, Juan
|
|
|
295 |
C |
p. 13-24
|
artikel
|
| 15 |
Vertex-pancyclism in the generalized sum of digraphs
|
Cordero-Michel, Narda
|
|
|
295 |
C |
p. 94-101
|
artikel
|
Tijdschrift beschrijving