Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             33 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A degree condition for a graph to have ( a , b ) -parity factors Liu, Haodong
2018
341 1 p. 244-252
artikel
2 A new approach to the chromatic number of the square of Kneser graph K ( 2 k + 1 , k ) Kang, Jeong-Hyun
2018
341 1 p. 96-103
artikel
3 A note on the Hamilton–Waterloo problem with C 8 -factors and C m -factors Wang, L.
2018
341 1 p. 67-73
artikel
4 A panconnectivity theorem for bipartite graphs Du, Hui
2018
341 1 p. 151-154
artikel
5 A strengthened inequality of Alon–Babai–Suzuki’s conjecture on set systems with restricted intersections modulo p Wang, Xin
2018
341 1 p. 109-118
artikel
6 Clones in matroids representable over a prime field Gray, Adam
2018
341 1 p. 213-216
artikel
7 Constructions for orthogonal designs using signed group orthogonal designs Ghaderpour, Ebrahim
2018
341 1 p. 277-285
artikel
8 Degree Ramsey numbers for even cycles Tait, Michael
2018
341 1 p. 104-108
artikel
9 Diameter bounds for geometric distance-regular graphs Bang, Sejeong
2018
341 1 p. 253-260
artikel
10 Distinct distances between a collinear set and an arbitrary set of points Bruner, Ariel
2018
341 1 p. 261-265
artikel
11 Domination in the hierarchical product and Vizing’s conjecture Anderson, S.E.
2018
341 1 p. 20-24
artikel
12 Existence and non-existence results for strong external difference families Huczynska, Sophie
2018
341 1 p. 87-95
artikel
13 Hall sets, Lazard sets and comma-free codes Perrin, Dominique
2018
341 1 p. 232-243
artikel
14 How fast can Maker win in fair biased games? Clemens, Dennis
2018
341 1 p. 51-66
artikel
15 Identifying defective sets using queries of small size Benevides, Fabrício S.
2018
341 1 p. 143-150
artikel
16 Independent domination in subcubic graphs of girth at least six Abrishami, Gholamreza
2018
341 1 p. 155-164
artikel
17 Large values of the clustering coefficient Gentner, Michael
2018
341 1 p. 119-125
artikel
18 Locating a robber with multiple probes Haslegrave, John
2018
341 1 p. 184-193
artikel
19 Maximality of the signless Laplacian energy Pinheiro, Lucélia Kowalski
2018
341 1 p. 33-41
artikel
20 Maximum scattered F q -linear sets of PG ( 1 , q 4 ) Csajbók, Bence
2018
341 1 p. 74-80
artikel
21 Monochromatic tree covers and Ramsey numbers for set-coloured graphs Bustamante, Sebastián
2018
341 1 p. 266-276
artikel
22 More odd graph theory from another point of view Morteza Mirafzal, S.
2018
341 1 p. 217-220
artikel
23 Neighborhood degree lists of graphs Barrus, Michael D.
2018
341 1 p. 175-183
artikel
24 Nowhere-zero 3 -flow of graphs with small independence number Li, Jiaao
2018
341 1 p. 42-50
artikel
25 On nice and injective-nice tournaments Rapke, T.K.
2018
341 1 p. 1-19
artikel
26 On the determinant of the Laplacian matrix of a complex unit gain graph Wang, Yi
2018
341 1 p. 81-86
artikel
27 On the girth and diameter of generalized Johnson graphs Agong, Louis Anthony
2018
341 1 p. 138-142
artikel
28 On vertex-disjoint cycles and degree sum conditions Gould, Ronald J.
2018
341 1 p. 203-212
artikel
29 Properties of minimally t -tough graphs Katona, Gyula Y.
2018
341 1 p. 221-231
artikel
30 Strong vertex-magic and edge-magic labelings of 2-regular graphs of odd order using Kotzig completion McQuillan, Dan
2018
341 1 p. 194-202
artikel
31 The size of a graph is reconstructible from any n − 2 cards Brown, Paul
2018
341 1 p. 165-174
artikel
32 Topological multiplicity of the maximum eigenvalue of graph 1 -Laplacian Zhang, Dong
2018
341 1 p. 25-32
artikel
33 Turán number and decomposition number of intersecting odd cycles Hou, Xinmin
2018
341 1 p. 126-137
artikel
                             33 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland