| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A new concatenated type construction for LCD codes and isometry codes
|
Carlet, Claude
|
|
2018
|
341 |
3 |
p. 830-835
|
artikel
|
| 2 |
A note on Bartholdi zeta function and graph invariants based on resistance distance
|
Li, Deqiong
|
|
2018
|
341 |
3 |
p. 786-792
|
artikel
|
| 3 |
A note on panchromatic colorings
|
Cherkashin, Danila
|
|
2018
|
341 |
3 |
p. 652-657
|
artikel
|
| 4 |
An update on non-Hamiltonian 5 4 -tough maximal planar graphs
|
Kabela, Adam
|
|
2018
|
341 |
3 |
p. 579-587
|
artikel
|
| 5 |
A problem on partial sums in abelian groups
|
Costa, S.
|
|
2018
|
341 |
3 |
p. 705-712
|
artikel
|
| 6 |
A sharp lower bound on Steiner Wiener index for trees with given diameter
|
Lu, Lu
|
|
2018
|
341 |
3 |
p. 723-731
|
artikel
|
| 7 |
A simple characterization of special matchings in lower Bruhat intervals
|
Caselli, Fabrizio
|
|
2018
|
341 |
3 |
p. 851-862
|
artikel
|
| 8 |
Choosability with union separation
|
Kumbhat, Mohit
|
|
2018
|
341 |
3 |
p. 600-605
|
artikel
|
| 9 |
Coverings: Variations on a result of Rogers and on the Epsilon-net theorem of Haussler and Welzl
|
Frankl, Nóra
|
|
2018
|
341 |
3 |
p. 863-874
|
artikel
|
| 10 |
d -matching in 3-uniform hypergraphs
|
Zhang, Yi
|
|
2018
|
341 |
3 |
p. 748-758
|
artikel
|
| 11 |
Editorial Board
|
|
|
2018
|
341 |
3 |
p. ii
|
artikel
|
| 12 |
Global forcing number for maximal matchings
|
Vukičević, Damir
|
|
2018
|
341 |
3 |
p. 801-809
|
artikel
|
| 13 |
Graph coloring and Graham’s greatest common divisor problem
|
Bosek, Bartłomiej
|
|
2018
|
341 |
3 |
p. 781-785
|
artikel
|
| 14 |
Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7
|
Borodin, O.V.
|
|
2018
|
341 |
3 |
p. 825-829
|
artikel
|
| 15 |
Inverse relations in Shapiro’s open questions
|
Kim, Ik-Pyo
|
|
2018
|
341 |
3 |
p. 691-700
|
artikel
|
| 16 |
List colouring of graphs and generalized Dyck paths
|
Xu, Rongxing
|
|
2018
|
341 |
3 |
p. 810-819
|
artikel
|
| 17 |
Minimizing the number of independent sets in triangle-free regular graphs
|
Cutler, Jonathan
|
|
2018
|
341 |
3 |
p. 793-800
|
artikel
|
| 18 |
Multi-set neighbor distinguishing 3-edge coloring
|
Vučković, Bojan
|
|
2018
|
341 |
3 |
p. 820-824
|
artikel
|
| 19 |
Null decomposition of trees
|
Jaume, Daniel A.
|
|
2018
|
341 |
3 |
p. 836-850
|
artikel
|
| 20 |
On the excess of vertex-transitive graphs of given degree and girth
|
Filipovski, Slobodan
|
|
2018
|
341 |
3 |
p. 772-780
|
artikel
|
| 21 |
On the existence of 3 - and 4 -kernels in digraphs
|
González Hermosillo de la Maza, Sebastián
|
|
2018
|
341 |
3 |
p. 638-651
|
artikel
|
| 22 |
On the spanning connectivity of the generalized Petersen graphs P ( n , 3 )
|
Wang, Jeng-Jung
|
|
2018
|
341 |
3 |
p. 672-690
|
artikel
|
| 23 |
On the weight distributions of a class of cyclic codes
|
Liu, Hongwei
|
|
2018
|
341 |
3 |
p. 759-771
|
artikel
|
| 24 |
Orthogonally Resolvable Matching Designs
|
Danziger, P.
|
|
2018
|
341 |
3 |
p. 701-704
|
artikel
|
| 25 |
Planar graphs without 3 -cycles adjacent to cycles of length 3 or 5 are ( 3 , 1 ) -colorable
|
Miao, Zhengke
|
|
2018
|
341 |
3 |
p. 588-599
|
artikel
|
| 26 |
Proper colouring Painter–Builder game
|
Bednarska-Bzdęga, Małgorzata
|
|
2018
|
341 |
3 |
p. 658-664
|
artikel
|
| 27 |
Query complexity of mastermind variants
|
Berger, Aaron
|
|
2018
|
341 |
3 |
p. 665-671
|
artikel
|
| 28 |
Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs
|
Casselgren, Carl Johan
|
|
2018
|
341 |
3 |
p. 627-637
|
artikel
|
| 29 |
The list chromatic index of simple graphs whose odd cycles intersect in at most one edge
|
McDonald, Jessica
|
|
2018
|
341 |
3 |
p. 713-722
|
artikel
|
| 30 |
The parity Hamiltonian cycle problem
|
Nishiyama, Hiroshi
|
|
2018
|
341 |
3 |
p. 606-626
|
artikel
|
| 31 |
The smallest surface that contains all signed graphs on K 4 , n
|
Lv, Shengxiang
|
|
2018
|
341 |
3 |
p. 732-747
|
artikel
|
Tijdschrift beschrijving