| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth
|
Katona, Gyula Y.
|
|
|
40 |
5 |
|
artikel
|
| 2 |
Existential Closure in Line Graphs
|
Burgess, Andrea C.
|
|
|
40 |
5 |
|
artikel
|
| 3 |
Independence Number and Maximal Chromatic Polynomials of Connected Graphs
|
Long, Shude
|
|
|
40 |
5 |
|
artikel
|
| 4 |
Maximal Colourings for Graphs
|
Mulas, Raffaella
|
|
|
40 |
5 |
|
artikel
|
| 5 |
New Tools to Study 1-11-Representation of Graphs
|
Futorny, Mikhail
|
|
|
40 |
5 |
|
artikel
|
| 6 |
Normalized Laplacian Eigenvalues of Hypergraphs
|
Xu, Leyou
|
|
|
40 |
5 |
|
artikel
|
| 7 |
On the Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree
|
Liang, Zuosong
|
|
|
40 |
5 |
|
artikel
|
| 8 |
On the Structure of a Smallest Counterexample and a New Class Verifying the 2-Decomposition Conjecture
|
Botler, F.
|
|
|
40 |
5 |
|
artikel
|
| 9 |
Ramsey Numbers of Multiple Copies of Graphs in a Component
|
Huang, Caixia
|
|
|
40 |
5 |
|
artikel
|
| 10 |
The Maximum Sum of Sizes of Non-Empty Cross t-Intersecting Families
|
Li, Shuang
|
|
|
40 |
5 |
|
artikel
|
| 11 |
The Planar Turán Number of {K4,C5} and {K4,C6}
|
Győri, Ervin
|
|
|
40 |
5 |
|
artikel
|
| 12 |
The Vertex Arboricity of 1-Planar Graphs
|
Zhang, Dongdong
|
|
|
40 |
5 |
|
artikel
|
Tijdschrift beschrijving