nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An algebraic approach to asymptotics of the number of unlabeled bicolored graphs
|
Salch, Andrew |
|
|
348 |
12 |
p. |
artikel |
2 |
An ( F 2 , F 6 ) -partition of planar graphs without cycles of length 4 and 6
|
Huang, Ziwen |
|
|
348 |
12 |
p. |
artikel |
3 |
An optimal construction for complete graph embeddings with duals of low connectivity
|
Sun, Timothy |
|
|
348 |
12 |
p. |
artikel |
4 |
A note on the maximum size of the ground set of skew Bollobás systems
|
Fang, Yu |
|
|
348 |
12 |
p. |
artikel |
5 |
An overpartition companion of Andrews and Keith's 2-colored q-series identity
|
Waldron, Hunter |
|
|
348 |
12 |
p. |
artikel |
6 |
A refined view of a curious identity for partitions into odd parts with designated summands
|
Fu, Shishuo |
|
|
348 |
12 |
p. |
artikel |
7 |
Asymmetry of 2-step transit probabilities in 2-coloured regular graphs
|
Gray, Ron |
|
|
348 |
12 |
p. |
artikel |
8 |
Bijections in weakly increasing trees via binary trees
|
Li, Yang |
|
|
348 |
12 |
p. |
artikel |
9 |
Bisections of directed graphs without complete bipartite subgraphs
|
Ma, Wanjuan |
|
|
348 |
12 |
p. |
artikel |
10 |
Chip-firing on graphs of groups
|
Meyer, Margaret |
|
|
348 |
12 |
p. |
artikel |
11 |
Complete bipartite immersion in graphs with independence number two: A simple proof
|
Chen, Rong |
|
|
348 |
12 |
p. |
artikel |
12 |
Connectivity threshold for superpositions of Bernoulli random graphs
|
Ardickas, Daumilas |
|
|
348 |
12 |
p. |
artikel |
13 |
Degree condition on distance three for Hamiltonian-biconnected in balanced bipartite graphs
|
Wang, Ruixia |
|
|
348 |
12 |
p. |
artikel |
14 |
Editorial Board
|
|
|
|
348 |
12 |
p. |
artikel |
15 |
Enumerating permutations avoiding split patterns 3|12 and 23|1
|
Grigsby, Travis |
|
|
348 |
12 |
p. |
artikel |
16 |
Enumeration of sets of equiangular lines with common angle arccos ( 1 / 3 )
|
Yoshino, Kiyoto |
|
|
348 |
12 |
p. |
artikel |
17 |
Extremal graphs for star forests with bounded clique number
|
Lu, Yongchun |
|
|
348 |
12 |
p. |
artikel |
18 |
h-extra l-component connectivity of graphs and digraphs with minimum distance spectral radii
|
Hu, Yanling |
|
|
348 |
12 |
p. |
artikel |
19 |
Hopping forcing number in random d-regular graphs
|
Prałat, Paweł |
|
|
348 |
12 |
p. |
artikel |
20 |
Median eigenvalues of sparse subcubic graphs
|
Chen, Zhengbo |
|
|
348 |
12 |
p. |
artikel |
21 |
Minimum saturated graphs without 4-cycles and 5-cycles
|
Ma, Yue |
|
|
348 |
12 |
p. |
artikel |
22 |
Modulo factors with bounded degrees
|
Hasanvand, Morteza |
|
|
348 |
12 |
p. |
artikel |
23 |
On finding the eigenvalues of the matrix of rotation symmetric Boolean functions
|
Albrizzio, Manuel |
|
|
348 |
12 |
p. |
artikel |
24 |
On the girth and connectivity of cubic graphs with a unique longest cycle
|
Jooken, Jorik |
|
|
348 |
12 |
p. |
artikel |
25 |
Out of the parking lot and into the forest: Parking functions, bond lattices, and unimodal forests
|
Brooks, Josephine |
|
|
348 |
12 |
p. |
artikel |
26 |
Packing large balanced trees into bipartite graphs
|
G. Fernandes, Cristina |
|
|
348 |
12 |
p. |
artikel |
27 |
Packing of the k-power of Hamilton cycles
|
Chen, Wanfang |
|
|
348 |
12 |
p. |
artikel |
28 |
2P 3-free graphs that do not contain any induced subdivision of K 4 are 4-colorable
|
Chen, Na |
|
|
348 |
12 |
p. |
artikel |
29 |
Representing GRM codes over finite rings
|
Shi, Minjia |
|
|
348 |
12 |
p. |
artikel |
30 |
Several classes of wide minimal binary linear codes based on general Maiorana-McFarland class
|
Du, Xiaoni |
|
|
348 |
12 |
p. |
artikel |
31 |
Shellability of Kohnert posets
|
Kerr, Celia |
|
|
348 |
12 |
p. |
artikel |
32 |
Spectral radius and hamiltonicity in split graphs
|
Zhu, Yinfen |
|
|
348 |
12 |
p. |
artikel |
33 |
The e-positivity of the chromatic symmetric function for twinned paths and cycles
|
Banaian, Esther |
|
|
348 |
12 |
p. |
artikel |
34 |
The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs
|
Anderson, James |
|
|
348 |
12 |
p. |
artikel |
35 |
The randomized query complexity of finding a Tarski fixed point on the Boolean hypercube
|
Brânzei, Simina |
|
|
348 |
12 |
p. |
artikel |
36 |
Total isolation of k-cliques in a graph
|
Cao, Yupei |
|
|
348 |
12 |
p. |
artikel |
37 |
Two new families of linear codes with five Lee-weights over F q + u F q and their Gray images
|
Ding, Yun |
|
|
348 |
12 |
p. |
artikel |
38 |
Weak degeneracy of line graphs of planar graphs
|
Xu, Ningyan |
|
|
348 |
12 |
p. |
artikel |