| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A construction of linear codes and strongly regular graphs from q -polynomials
|
Luo, Gaojun
|
|
2017
|
340 |
9 |
p. 2262-2274
|
artikel
|
| 2 |
A new characterization of equipartite graphs
|
Shirdareh Haghighi, M.H.
|
|
2017
|
340 |
9 |
p. 2086-2090
|
artikel
|
| 3 |
A topological framework for signed permutations
|
Huang, Fenix W.D.
|
|
2017
|
340 |
9 |
p. 2161-2182
|
artikel
|
| 4 |
A weighted Möbius function
|
Garton, Derek
|
|
2017
|
340 |
9 |
p. 2200-2207
|
artikel
|
| 5 |
Bounded clique cover of some sparse graphs
|
Munaro, Andrea
|
|
2017
|
340 |
9 |
p. 2208-2216
|
artikel
|
| 6 |
Circumferences of 3-connected claw-free graphs, II
|
Chen, Zhi-Hong
|
|
2017
|
340 |
9 |
p. 2091-2107
|
artikel
|
| 7 |
Decomposing 8-regular graphs into paths of length 4
|
Botler, F.
|
|
2017
|
340 |
9 |
p. 2275-2285
|
artikel
|
| 8 |
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
|
Benevides, Fabrício S.
|
|
2017
|
340 |
9 |
p. 2143-2160
|
artikel
|
| 9 |
Enumerations of vertices among all rooted ordered trees with levels and degrees
|
Eu, Sen-Peng
|
|
2017
|
340 |
9 |
p. 2123-2129
|
artikel
|
| 10 |
Every planar graph without cycles of length 4 or 9 is ( 1 , 1 , 0 ) -colorable
|
Dai, Lifeng
|
|
2017
|
340 |
9 |
p. 2108-2122
|
artikel
|
| 11 |
Exponentially many graphs have a Q -cospectral mate
|
Carvalho, João
|
|
2017
|
340 |
9 |
p. 2079-2085
|
artikel
|
| 12 |
Forbidden pairs of disconnected graphs for traceability in connected graphs
|
Du, Junfeng
|
|
2017
|
340 |
9 |
p. 2194-2199
|
artikel
|
| 13 |
Graphs constructible from cycles and complete graphs
|
Jamison, Robert E.
|
|
2017
|
340 |
9 |
p. 2301-2306
|
artikel
|
| 14 |
Improving bounds on the diameter of a polyhedron in high dimensions
|
Sukegawa, Noriyoshi
|
|
2017
|
340 |
9 |
p. 2134-2142
|
artikel
|
| 15 |
Lambert series and conjugacy classes in G L
|
Merca, Mircea
|
|
2017
|
340 |
9 |
p. 2223-2233
|
artikel
|
| 16 |
Lemke graphs and Graham’s pebbling conjecture
|
Gao, Ze-Tu
|
|
2017
|
340 |
9 |
p. 2318-2332
|
artikel
|
| 17 |
Non-existence of two types of partial difference sets
|
De Winter, Stefaan
|
|
2017
|
340 |
9 |
p. 2130-2133
|
artikel
|
| 18 |
On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
|
Borodin, O.V.
|
|
2017
|
340 |
9 |
p. 2234-2242
|
artikel
|
| 19 |
On symmetric graphs of order four times an odd square-free integer and valency seven
|
Pan, Jiangmin
|
|
2017
|
340 |
9 |
p. 2071-2078
|
artikel
|
| 20 |
On two conjectures about the proper connection number of graphs
|
Huang, Fei
|
|
2017
|
340 |
9 |
p. 2217-2222
|
artikel
|
| 21 |
Poisson approximation of counts of induced subgraphs in random intersection graphs
|
Rybarczyk, Katarzyna
|
|
2017
|
340 |
9 |
p. 2183-2193
|
artikel
|
| 22 |
Repeated-root constacyclic codes of length n l p s
|
Liu, Li
|
|
2017
|
340 |
9 |
p. 2250-2261
|
artikel
|
| 23 |
Some more uniformly resolvable designs with block sizes 2 and 4
|
Wei, Hengjia
|
|
2017
|
340 |
9 |
p. 2243-2249
|
artikel
|
| 24 |
The maximum product of sizes of cross-intersecting families
|
Borg, Peter
|
|
2017
|
340 |
9 |
p. 2307-2317
|
artikel
|
| 25 |
The mechanics of shuffle products and their siblings
|
Duchamp, Gérard H.E.
|
|
2017
|
340 |
9 |
p. 2286-2300
|
artikel
|
Tijdschrift beschrijving