| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A forest building process on simple graphs
|
Berikkyzy, Zhanar
|
|
2018
|
341 |
2 |
p. 497-507
11 p.
|
artikel
|
| 2 |
A generalized Goulden–Jackson cluster method and lattice path enumeration
|
Zhuang, Yan
|
|
2018
|
341 |
2 |
p. 358-379
22 p.
|
artikel
|
| 3 |
A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs
|
Gu, Xiaofeng
|
|
2018
|
341 |
2 |
p. 400-404
5 p.
|
artikel
|
| 4 |
Asymptotically good quasi-cyclic codes of fractional index
|
Mi, Jiafu
|
|
2018
|
341 |
2 |
p. 308-314
7 p.
|
artikel
|
| 5 |
A topological lower bound for the chromatic number of a special family of graphs
|
Daneshpajouh, Hamid Reza
|
|
2018
|
341 |
2 |
p. 508-512
5 p.
|
artikel
|
| 6 |
Between Shi and Ish
|
Duarte, Rui
|
|
2018
|
341 |
2 |
p. 388-399
12 p.
|
artikel
|
| 7 |
Combinatorial and probabilistic formulae for divided symmetrization
|
Petrov, F.
|
|
2018
|
341 |
2 |
p. 336-340
5 p.
|
artikel
|
| 8 |
Complete weight enumerators of a class of linear codes with two weights
|
Xu, Guangkui
|
|
2018
|
341 |
2 |
p. 525-535
11 p.
|
artikel
|
| 9 |
Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number
|
Milz, Sebastian
|
|
2018
|
341 |
2 |
p. 484-491
8 p.
|
artikel
|
| 10 |
Enumerating cycles in the graph of overlapping permutations
|
Asplund, John
|
|
2018
|
341 |
2 |
p. 427-438
12 p.
|
artikel
|
| 11 |
Equation-regular sets and the Fox–Kleitman conjecture
|
Adhikari, S.D.
|
|
2018
|
341 |
2 |
p. 287-298
12 p.
|
artikel
|
| 12 |
Every signed planar graph without cycles of length from 4 to 8 is 3-colorable
|
Hu, Lili
|
|
2018
|
341 |
2 |
p. 513-519
7 p.
|
artikel
|
| 13 |
Existence of incomplete canonical Kirkman packing designs
|
Wang, Lingye
|
|
2018
|
341 |
2 |
p. 536-554
19 p.
|
artikel
|
| 14 |
Extremal product-one free sequences in Dihedral and Dicyclic Groups
|
Brochero Martínez, F.E.
|
|
2018
|
341 |
2 |
p. 570-578
9 p.
|
artikel
|
| 15 |
Fair and internally fair (holey) hamiltonian decompositions of K ( n 0 , … , n p − 1 ; λ 1 , λ 2 )
|
Erzurumluoğlu, Aras
|
|
2018
|
341 |
2 |
p. 315-323
9 p.
|
artikel
|
| 16 |
Game of cops and robbers in oriented quotients of the integer grid
|
Hosseini, Seyyed Aliasghar
|
|
2018
|
341 |
2 |
p. 439-450
12 p.
|
artikel
|
| 17 |
Ideal ramp schemes and related combinatorial objects
|
Stinson, Douglas R.
|
|
2018
|
341 |
2 |
p. 299-307
9 p.
|
artikel
|
| 18 |
Improved FPT algorithms for weighted independent set in bull-free graphs
|
Perret du Cray, Henri
|
|
2018
|
341 |
2 |
p. 451-462
12 p.
|
artikel
|
| 19 |
List neighbor sum distinguishing edge coloring of subcubic graphs
|
Lu, You
|
|
2018
|
341 |
2 |
p. 555-569
15 p.
|
artikel
|
| 20 |
Lonesum decomposable matrices
|
Kamano, Ken
|
|
2018
|
341 |
2 |
p. 341-349
9 p.
|
artikel
|
| 21 |
On a class of quaternary complex Hadamard matrices
|
Fender, Kai
|
|
2018
|
341 |
2 |
p. 421-426
6 p.
|
artikel
|
| 22 |
On self-dual constacyclic codes of length p s over F p m + u F p m
|
Dinh, Hai Q.
|
|
2018
|
341 |
2 |
p. 324-335
12 p.
|
artikel
|
| 23 |
Packing chromatic number of cubic graphs
|
Balogh, József
|
|
2018
|
341 |
2 |
p. 474-483
10 p.
|
artikel
|
| 24 |
Regular Hadamard matrices constructed from Hadamard 2-designs and conference graphs
|
Crnković, Dean
|
|
2018
|
341 |
2 |
p. 520-524
5 p.
|
artikel
|
| 25 |
Structure and algorithms for (cap, even hole)-free graphs
|
Cameron, Kathie
|
|
2018
|
341 |
2 |
p. 463-473
11 p.
|
artikel
|
| 26 |
The D-optimal saturated designs of order 22
|
Chasiotis, Vasilis
|
|
2018
|
341 |
2 |
p. 380-387
8 p.
|
artikel
|
| 27 |
Transversals in completely reducible multiary quasigroups and in multiary quasigroups of order 4
|
Taranenko, A.A.
|
|
2018
|
341 |
2 |
p. 405-420
16 p.
|
artikel
|
| 28 |
Turán numbers of vertex-disjoint cliques in r -partite graphs
|
De Silva, Jessica
|
|
2018
|
341 |
2 |
p. 492-496
5 p.
|
artikel
|
| 29 |
Two-weight and three-weight codes from trace codes over F p + u F p + v F p + u v F p
|
Liu, Yan
|
|
2018
|
341 |
2 |
p. 350-357
8 p.
|
artikel
|
Tijdschrift beschrijving