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
 
                             162 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A combinatorial characterization of the Hermitian surface Innamorati, Stefano
2013
13 p. 1496-1499
4 p.
artikel
2 A degree sum condition for graphs to be prism hamiltonian Ozeki, Kenta
2009
13 p. 4266-4269
4 p.
artikel
3 Affine blocking sets, three-dimensional codes and the Griesmer bound Ball, Simeon
2007
13 p. 1600-1608
9 p.
artikel
4 A generalization of a classical zero-sum problem Luca, Florian
2007
13 p. 1672-1678
7 p.
artikel
5 A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6 Burger, A.P.
2011
13 p. 1223-1228
6 p.
artikel
6 All graphs with maximum degree three whose complements have 4-cycle decompositions Fu, Chin-Mei
2008
13 p. 2901-2909
9 p.
artikel
7 All triples for orthogonal designs of order 40 Holzmann, W.H.
2008
13 p. 2796-2801
6 p.
artikel
8 A method of finding automorphism groups of endomorphism monoids of relational systems Araújo, João
2007
13 p. 1609-1620
12 p.
artikel
9 A new bound for neighbor-connectivity of abelian Cayley graphs Doty, Lynne L.
2006
13 p. 1301-1316
16 p.
artikel
10 A new characterization of projections of quadrics in finite projective spaces of even characteristic De Clerck, F.
2011
13 p. 1179-1186
8 p.
artikel
11 A note on acyclic edge coloring of complete bipartite graphs Basavaraju, Manu
2009
13 p. 4646-4648
3 p.
artikel
12 A note on Berge–Fulkerson coloring Hao, Rongxia
2009
13 p. 4235-4240
6 p.
artikel
13 A note on class one graphs with maximum degree six Li, Xuechao
2006
13 p. 1450-1455
6 p.
artikel
14 Applications of operator identities to the multiple q-binomial theorem and q-Gauss summation theorem Zhang, Zhizheng
2006
13 p. 1424-1437
14 p.
artikel
15 A simple proof of an inequality connecting the alternating number of independent sets and the decycling number Levit, Vadim E.
2011
13 p. 1204-1206
3 p.
artikel
16 A small non- Z 4 -colorable planar graph Montassier, Mickaël
2007
13 p. 1684-1686
3 p.
artikel
17 Blockers and transversals Zenklusen, R.
2009
13 p. 4306-4314
9 p.
artikel
18 Blocker sets, orthogonal arrays and their application to combination locks Baartmans, Alphonse
2008
13 p. 2885-2895
11 p.
artikel
19 Bounds on the location of the maximum Stirling numbers of the second kind Yu, Yaming
2009
13 p. 4624-4627
4 p.
artikel
20 Broadcasts and domination in trees Cockayne, E.J.
2011
13 p. 1235-1246
12 p.
artikel
21 Canonical and monophonic convexities in hypergraphs Malvestuto, Francesco M.
2009
13 p. 4287-4298
12 p.
artikel
22 Canonical Ramsey numbers and properly colored cycles Jiang, Tao
2009
13 p. 4247-4252
6 p.
artikel
23 Cayley digraphs with normal adjacency matrices Lyubshin, David S.
2009
13 p. 4343-4348
6 p.
artikel
24 Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 Galeana-Sánchez, Hortensia
2013
13 p. 1464-1474
11 p.
artikel
25 Circular game chromatic number of graphs Lin, Wensong
2009
13 p. 4495-4501
7 p.
artikel
26 Classification of partitions of all triples on ten points into copies of Fano and affine planes Mathon, Rudolf
2008
13 p. 2789-2795
7 p.
artikel
27 Color degree and alternating cycles in edge-colored graphs Wang, Guanghui
2009
13 p. 4349-4354
6 p.
artikel
28 Combinatorial Designs: A tribute to Jennifer Seberry on her 60th Birthday Launey, Warwick de
2008
13 p. 2655-2656
2 p.
artikel
29 Complete r -partite subgraphs of dense r -graphs Nikiforov, Vladimir
2009
13 p. 4326-4331
6 p.
artikel
30 Constructing continuum many countable, primitive, unbalanced digraphs Emms, Josephine
2009
13 p. 4475-4480
6 p.
artikel
31 Constructing strength three covering arrays with augmented annealing Cohen, Myra B.
2008
13 p. 2709-2722
14 p.
artikel
32 Construction for bicritical graphs and k-extendable bipartite graphs Zhang, Fuji
2006
13 p. 1415-1423
9 p.
artikel
33 Construction of optimal ternary constant weight codes via Bhaskar Rao designs Ge, Gennian
2008
13 p. 2704-2708
5 p.
artikel
34 Contents 2006
13 p. vii-viii
nvt p.
artikel
35 Contents 2007
13 p. vii-viii
nvt p.
artikel
36 Counting polycubes without the dimensionality curse Aleksandrowicz, Gadi
2009
13 p. 4576-4583
8 p.
artikel
37 Covering partially directed graphs with directed paths Rizzi, Romeo
2006
13 p. 1390-1404
15 p.
artikel
38 Cubic planar hamiltonian graphs of various types Kao, Shin-Shin
2006
13 p. 1364-1389
26 p.
artikel
39 Degree sum conditions for oriented forests in digraphs Qiao, Shengning
2009
13 p. 4642-4645
4 p.
artikel
40 3-Designs with block size 6 from PSL ( 2 , q ) and their large sets Omidi, G.R.
2007
13 p. 1580-1588
9 p.
artikel
41 Determinants of grids, tori, cylinders and Möbius ladders Bibak, Khodakhast
2013
13 p. 1436-1440
5 p.
artikel
42 Dominating direct products of graphs Brešar, Boštjan
2007
13 p. 1636-1642
7 p.
artikel
43 Edge bounds in nonhamiltonian k -connected graphs Byer, Owen D.
2007
13 p. 1572-1579
8 p.
artikel
44 Edges of degree k in minimally restricted k -edge connected graphs Hong, Yanmei
2009
13 p. 4448-4455
8 p.
artikel
45 Editorial board 2006
13 p. v-vi
nvt p.
artikel
46 Editorial board 2007
13 p. v-vi
nvt p.
artikel
47 Equipartite gregarious 6- and 8-cycle systems Billington, Elizabeth J.
2007
13 p. 1659-1667
9 p.
artikel
48 Error-correcting codes from permutation groups Bailey, Robert F.
2009
13 p. 4253-4265
13 p.
artikel
49 Extended directed triple systems Huang, Wen-Chung
2006
13 p. 1351-1357
7 p.
artikel
50 Factors of the Gaussian coefficients Chen, William Y.C.
2006
13 p. 1446-1449
4 p.
artikel
51 Feedback numbers of Kautz digraphs Xu, Jun-Ming
2007
13 p. 1589-1599
11 p.
artikel
52 f -factors, complete-factors, and component-deleted subgraphs Kimura, Kenji
2013
13 p. 1452-1463
12 p.
artikel
53 Gallai–Ramsey numbers for cycles Fujita, Shinya
2011
13 p. 1247-1254
8 p.
artikel
54 Game colouring of the square of graphs Esperet, Louis
2009
13 p. 4514-4521
8 p.
artikel
55 Generalised acyclic edge colourings of graphs with large girth Gerke, Stefanie
2007
13 p. 1668-1671
4 p.
artikel
56 Generalization of transitive fraternal augmentations for directed graphs and its applications Yang, Daqing
2009
13 p. 4614-4623
10 p.
artikel
57 Θ -graceful labelings of partial cubes Brešar, Boštjan
2006
13 p. 1264-1271
8 p.
artikel
58 Graphs of order two less than the Moore bound Miller, Mirka
2008
13 p. 2810-2821
12 p.
artikel
59 Gray code for permutations with a fixed number of cycles Baril, Jean-Luc
2007
13 p. 1559-1571
13 p.
artikel
60 Group divisible designs with block size four and two groups Hurd, Spencer P.
2008
13 p. 2663-2673
11 p.
artikel
61 Guest Editors 2008
13 p. 2657-
1 p.
artikel
62 Guide for authors 2006
13 p. I-IV
nvt p.
artikel
63 Halving Steiner 2-designs Fujiwara, Yuichiro
2007
13 p. 1551-1558
8 p.
artikel
64 Improving solutions of ∑ i = 1 k 1 / x i = 1 with restrictions as required by Barbeau respectively by Johnson Burshtein, Nechemia
2006
13 p. 1438-1439
2 p.
artikel
65 Incongruent restricted disjoint covering systems Myerson, Gerry
2009
13 p. 4428-4434
7 p.
artikel
66 Independent arcs of acyclic orientations of complete r -partite graphs Chang, Gerard J.
2009
13 p. 4280-4286
7 p.
artikel
67 Interleaving schemes on circulant graphs with two offsets Slivkins, Aleksandrs
2009
13 p. 4384-4398
15 p.
artikel
68 Introduction 2008
13 p. 2658-
1 p.
artikel
69 Kernels by monochromatic paths in digraphs with covering number 2 Galeana-Sánchez, Hortensia
2011
13 p. 1111-1118
8 p.
artikel
70 Large forbidden trade volumes and edge packings of random graphs Wormald, Nicholas C.
2008
13 p. 2751-2755
5 p.
artikel
71 Linear and nonlinear constructions of DNA codes with Hamming distance d and constant G C -content Smith, Derek H.
2011
13 p. 1207-1219
13 p.
artikel
72 Matchings in 3-vertex-critical graphs: The odd case Ananchuen, Nawarat
2007
13 p. 1651-1658
8 p.
artikel
73 Maximal independent sets in minimum colorings Arumugam, S.
2011
13 p. 1158-1163
6 p.
artikel
74 Maximal integral point sets in affine planes over finite fields Kiermaier, Michael
2009
13 p. 4564-4575
12 p.
artikel
75 Maximal sets of hamilton cycles in K 2 p - F Fu, H.L.
2008
13 p. 2822-2829
8 p.
artikel
76 Maximal Sidon sets and matroids Dias da Silva, J.A.
2009
13 p. 4489-4494
6 p.
artikel
77 Minimal and locally minimal games and game forms Boros, Endre
2009
13 p. 4456-4468
13 p.
artikel
78 Minimal 2-matching-covered graphs Zhou, Shan
2009
13 p. 4270-4279
10 p.
artikel
79 Minimum embedding of STSs into ( K 3 + e ) -systems Gionfriddo, Mario
2013
13 p. 1419-1428
10 p.
artikel
80 Multi-latin squares Cavenagh, Nicholas
2011
13 p. 1164-1171
8 p.
artikel
81 Nash equilibria in all-optical networks Georgakopoulos, George F.
2009
13 p. 4332-4342
11 p.
artikel
82 Netlike partial cubes, V: Completion and netlike classes Polat, Norbert
2009
13 p. 4362-4376
15 p.
artikel
83 N -flips in even triangulations on the torus and Dehn twists preserving monodromies Higuchi, Yusuke
2011
13 p. 1128-1135
8 p.
artikel
84 Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues Charles, Zachary B.
2013
13 p. 1441-1451
11 p.
artikel
85 On a conjecture of V. Nikiforov Csikvári, Péter
2009
13 p. 4522-4526
5 p.
artikel
86 On affine designs and Hadamard designs with line spreads Mavron, V.C.
2008
13 p. 2742-2750
9 p.
artikel
87 On a graph’s security number Dutton, Ronald D.
2009
13 p. 4443-4447
5 p.
artikel
88 On b -coloring of the Kneser graphs Javadi, Ramin
2009
13 p. 4399-4408
10 p.
artikel
89 On Beck’s coloring of posets Halaš, Radomír
2009
13 p. 4584-4589
6 p.
artikel
90 On c -Bhaskar Rao Designs and tight embeddings for path designs Hurd, Spencer P.
2008
13 p. 2659-2662
4 p.
artikel
91 On colorings of graph powers Hajiabolhassan, Hossein
2009
13 p. 4299-4305
7 p.
artikel
92 On cyclic edge-connectivity of transitive graphs Wang, Bing
2009
13 p. 4555-4563
9 p.
artikel
93 On edge star sets in trees Akbari, S.
2011
13 p. 1172-1178
7 p.
artikel
94 On generalised t -designs and their parameters Soicher, Leonard H.
2011
13 p. 1136-1141
6 p.
artikel
95 On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs Chastand, Marc
2006
13 p. 1272-1284
13 p.
artikel
96 On graphs whose square have strong hamiltonian properties Chia, Gek L.
2009
13 p. 4608-4613
6 p.
artikel
97 On induced and isometric embeddings of graphs into the strong product of paths Jerebic, Janja
2006
13 p. 1358-1363
6 p.
artikel
98 On left Hadamard transversals in non-solvable groups Hiramine, Yutaka
2008
13 p. 2776-2780
5 p.
artikel
99 On minimal triangle-free graphs with prescribed k -defective chromatic number Achuthan, Nirmala
2011
13 p. 1119-1127
9 p.
artikel
100 On skew-Hadamard matrices Koukouvinos, C.
2008
13 p. 2723-2731
9 p.
artikel
101 On spanning tree congestion Löwenstein, Christian
2009
13 p. 4653-4655
3 p.
artikel
102 On spanning tree congestion of graphs Kozawa, Kyohei
2009
13 p. 4215-4224
10 p.
artikel
103 On the automorphisms of Paley's type II Hadamard matrix de Launey, Warwick
2008
13 p. 2910-2924
15 p.
artikel
104 On the 3-colorability of planar graphs without 4-, 7- and 9-cycles Lu, Huajing
2009
13 p. 4596-4607
12 p.
artikel
105 On the eccentric connectivity index of a graph Morgan, M.J.
2011
13 p. 1229-1234
6 p.
artikel
106 On the existence of k -partite or K p -free total domination edge-critical graphs Haynes, Teresa W.
2011
13 p. 1142-1149
8 p.
artikel
107 On the Laplacian spectral radii of trees Yuan, Xi-Ying
2009
13 p. 4241-4246
6 p.
artikel
108 On the minimum real roots of the adjoint polynomial of a graph Zhao, Haixing
2009
13 p. 4635-4641
7 p.
artikel
109 On the number of zero-sum subsequences Cao, Hui-Qin
2007
13 p. 1687-1691
5 p.
artikel
110 On the oriented chromatic number of graphs with given excess Dolama, Mohammad Hosseini
2006
13 p. 1342-1350
9 p.
artikel
111 On the range of influences in back-circulant Latin squares Khodkar, Abdollah
2008
13 p. 2896-2900
5 p.
artikel
112 Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups Alspach, Brian
2013
13 p. 1475-1489
15 p.
artikel
113 Packing and covering k -chain free subsets in Boolean lattices Shen, Jia
2009
13 p. 4628-4634
7 p.
artikel
114 Partitions of a set satisfying certain set of conditions Mansour, Toufik
2009
13 p. 4481-4488
8 p.
artikel
115 Permutation decoding for binary codes from lattice graphs Key, J.D.
2008
13 p. 2862-2867
6 p.
artikel
116 Power Hadamard matrices Craigen, R.
2008
13 p. 2868-2884
17 p.
artikel
117 Preface Edwards, Keith
2011
13 p. 1073-
1 p.
artikel
118 Primitive normal polynomials with the specified last two coefficients Fan, Shuqin
2009
13 p. 4502-4513
12 p.
artikel
119 Probabilistic averaging in bounded commutative residuated ℓ -monoids Dvurečenskij, Anatolij
2006
13 p. 1317-1326
10 p.
artikel
120 Properties, isomorphisms and enumeration of 2-Quasi-Magic Sudoku grids Jones, Siân K.
2011
13 p. 1098-1110
13 p.
artikel
121 Rectangular groupoids and related structures Boykett, Tim
2013
13 p. 1409-1418
10 p.
artikel
122 Recursive fault-tolerance of Fibonacci cube in hypercubes Gregor, Petr
2006
13 p. 1327-1341
15 p.
artikel
123 Regular Steinhaus graphs of odd degree Chappelon, Jonathan
2009
13 p. 4545-4554
10 p.
artikel
124 Relations on generalized degree sequences Klivans, Caroline J.
2009
13 p. 4377-4383
7 p.
artikel
125 Relative difference sets fixed by inversion (III)—Cocycle theoretical approach Chen, Yu Qing
2008
13 p. 2764-2775
12 p.
artikel
126 Research problems from the BCC22 Cameron, Peter J.
2011
13 p. 1074-1083
10 p.
artikel
127 Resolvable balanced incomplete block designs with subdesigns of block size 4 Ge, Gennian
2008
13 p. 2674-2703
30 p.
artikel
128 Resolvable gregarious cycle decompositions of complete equipartite graphs Billington, Elizabeth J.
2008
13 p. 2844-2853
10 p.
artikel
129 Solitary and edge-minimal bases for representations of the simple lie algebra G 2 Donnelly, Robert G.
2006
13 p. 1285-1300
16 p.
artikel
130 Some open combinatorial problems in the design of stated choice experiments Street, Deborah J.
2008
13 p. 2781-2788
8 p.
artikel
131 Some remarks about leaf roots Rautenbach, Dieter
2006
13 p. 1456-1461
6 p.
artikel
132 Some structural properties of minimally contraction-critically 5-connected graphs Ando, Kiyoshi
2011
13 p. 1084-1097
14 p.
artikel
133 Some sufficient conditions for a planar graph of maximum degree six to be Class 1 Bu, Yuehua
2006
13 p. 1440-1445
6 p.
artikel
134 Spreads, arcs, and multiple wavelength codes Alderson, T.L.
2011
13 p. 1187-1196
10 p.
artikel
135 Stability of the path–path Ramsey number Gyárfás, András
2009
13 p. 4590-4595
6 p.
artikel
136 Steiner triple systems of order 19 and 21 with subsystems of order 7 Kaski, Petteri
2008
13 p. 2732-2741
10 p.
artikel
137 Strong edge-magic graphs of maximum size MacDougall, J.A.
2008
13 p. 2756-2763
8 p.
artikel
138 Study of proper circulant weighing matrices with weight 9 Ang, Miin Huey
2008
13 p. 2802-2809
8 p.
artikel
139 Super-stationary set, subword problem and the complexity Kamae, Teturo
2009
13 p. 4417-4427
11 p.
artikel
140 The completeness problem in partial hyperclones Romov, B.A.
2006
13 p. 1405-1414
10 p.
artikel
141 The evolution of the min–min random graph process Coja-Oghlan, Amin
2009
13 p. 4527-4544
18 p.
artikel
142 The excedance algebra Clark, Eric
2013
13 p. 1429-1435
7 p.
artikel
143 The k -restricted edge connectivity of undirected Kautz graphs Wang, Shiying
2009
13 p. 4649-4652
4 p.
artikel
144 The maximum Randić index of chemical trees with k pendants Shiu, Wai Chee
2009
13 p. 4409-4416
8 p.
artikel
145 The Menger number of the strong product of graphs Abajo, E.
2013
13 p. 1490-1495
6 p.
artikel
146 The ordering of unicyclic graphs with the smallest algebraic connectivity Liu, Ying
2009
13 p. 4315-4325
11 p.
artikel
147 The power graph of a finite group Cameron, Peter J.
2011
13 p. 1220-1222
3 p.
artikel
148 The smallest size of a complete cap in PG ( 3 , 7 ) Bierbrauer, Jürgen
2006
13 p. 1257-1263
7 p.
artikel
149 The sum of the distances between the leaves of a tree and the ‘semi-regular’ property Székely, L.A.
2011
13 p. 1197-1203
7 p.
artikel
150 The Terwilliger algebra of the Johnson schemes Levstein, F.
2007
13 p. 1621-1635
15 p.
artikel
151 Total restrained domination in trees Hattingh, Johannes H.
2007
13 p. 1643-1650
8 p.
artikel
152 Translation groups of Steiner loops Strambach, Karl
2009
13 p. 4225-4227
3 p.
artikel
153 Tree-length equals branch-length Umezawa, Kaori
2009
13 p. 4656-4660
5 p.
artikel
154 Trees with the second largest number of maximal independent sets Jou, Min-Jen
2009
13 p. 4469-4474
6 p.
artikel
155 Two applications of relative difference sets: Difference triangles and negaperiodic autocorrelation functions Pott, Alexander
2008
13 p. 2854-2861
8 p.
artikel
156 Two short proofs of the bounded case of S.B. Rao’s degree sequence conjecture Sivaraman, Vaidy
2013
13 p. 1500-1501
2 p.
artikel
157 Uniformly resolvable designs with index one, block sizes three and five and up to five parallel classes with blocks of size five Schuster, Ernst
2009
13 p. 4435-4442
8 p.
artikel
158 Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number Hansen, Pierre
2009
13 p. 4228-4234
7 p.
artikel
159 Vertex coloring complete multipartite graphs from random lists of size 2 Casselgren, Carl Johan
2011
13 p. 1150-1157
8 p.
artikel
160 Vertex domination of generalized Petersen graphs Javad Ebrahimi, B.
2009
13 p. 4355-4361
7 p.
artikel
161 Vertex pancyclicity in quasi claw-free graphs Zhan, Mingquan
2007
13 p. 1679-1683
5 p.
artikel
162 When is a partial Latin square uniquely completable, but not its completable product? Cavenagh, Nicholas
2008
13 p. 2830-2843
14 p.
artikel
                             162 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland