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
 
                             117 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes Bose, R.C.
1966
1 p. 96-104
9 p.
artikel
2 A characterization of planar geodetic graphs Watkins, Mark E.
1967
1 p. 102-103
2 p.
artikel
3 A characterization problem in graph theory Aigner, Martin
1969
1 p. 45-55
11 p.
artikel
4 A class of hadamard matrices Wallis, Jennifer
1969
1 p. 40-44
5 p.
artikel
5 A coarseness conjecture of Erdös Guy, Richard K.
1967
1 p. 38-42
5 p.
artikel
6 A combinatorial formula involving the Fredholm integral equation Klarner, David A.
1968
1 p. 59-74
16 p.
artikel
7 A combinatorial invariant for finite Abelian groups with various applications Emerson, W.R.
1970
1 p. 72-92
21 p.
artikel
8 A completely unambiguous 5-polyhedral graph Barnette, David
1970
1 p. 44-53
10 p.
artikel
9 A correction to: On the algebraic theory of graph colorings Tutte, W.T.
1967
1 p. 102-
1 p.
artikel
10 A generalization of a partition theorem of MacMahon Andrews, George E.
1967
1 p. 100-101
2 p.
artikel
11 A generalization of the linear complementarity problem Cottle, Richard W.
1970
1 p. 79-90
12 p.
artikel
12 A lower bound for the order of a partial transversal in a latin square Koksma, Klaas K.
1969
1 p. 94-95
2 p.
artikel
13 A matching theorem for graphs Kleitman, D.
1970
1 p. 104-114
11 p.
artikel
14 A maximum principle for graphs Lyndon, R.C.
1967
1 p. 34-37
4 p.
artikel
15 An addition theorem for the elementary abelian group Olson, John E.
1968
1 p. 53-58
6 p.
artikel
16 An addition theorem modulo p Olson, John E.
1968
1 p. 45-52
8 p.
artikel
17 An application of a theorem of de Bruijn Tengbergen, and Kruyswijk Anderson, Ian
1967
1 p. 43-47
5 p.
artikel
18 An elementary proof of p(11m+6)≡0 (mod 11) Winquist, Lasse
1969
1 p. 56-59
4 p.
artikel
19 A new symmetry of partitions Dyson, Freeman J.
1969
1 p. 56-61
6 p.
artikel
20 An inequality for the chromatic number of a graph Szekeres, G.
1968
1 p. 1-3
3 p.
artikel
21 An introduction to chromatic polynomials Read, Ronald C.
1968
1 p. 52-71
20 p.
artikel
22 An inversion problem associated with compositions Stell, G.
1969
1 p. 7-11
5 p.
artikel
23 An orthogonality theorem of dines related to moment problems and linear programming Duffin, R.J.
1967
1 p. 1-26
26 p.
artikel
24 A note of welcome Polya, George
1966
1 p. 1-2
2 p.
artikel
25 A note on coefficients of chromatic polynomials Chvátal, V.
1970
1 p. 95-96
2 p.
artikel
26 A note on plane trees de Bruijn, N.G.
1967
1 p. 27-34
8 p.
artikel
27 A note on quasi-symmetric designs Wallis, W.D.
1970
1 p. 100-101
2 p.
artikel
28 A note on the enumeration of line chromatic trees Carlitz, L.
1969
1 p. 99-101
3 p.
artikel
29 A packing problem for parallelepipeds Rademacher, Hans
1966
1 p. 3-14
12 p.
artikel
30 Autometrized unary algebras Melter, Robert A.
1968
1 p. 21-29
9 p.
artikel
31 Barrage d'un espace cartésien à l'aide d'orthants aplatis Kreweras, Germain
1967
1 p. 83-92
10 p.
artikel
32 Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen Walther, Hansjoachim
1969
1 p. 1-6
6 p.
artikel
33 Block designs and graph theory Di Paola, Jane W.
1966
1 p. 132-148
17 p.
artikel
34 Bounds for the chromatic number of a graph Bondy, J.A.
1969
1 p. 96-98
3 p.
artikel
35 Cardinality of finite topologies Sharp Jr., Henry
1968
1 p. 82-86
5 p.
artikel
36 Characters and complexity of finite semigroups Rhodes, John
1969
1 p. 67-85
19 p.
artikel
37 Combinatorial theorems and integral matrices Mirsky, L.
1968
1 p. 30-44
15 p.
artikel
38 Connected graphs with unlabeled end-points Moon, J.W.
1969
1 p. 65-66
2 p.
artikel
39 Connectivity of transitive graphs Watkins, Mark E.
1970
1 p. 23-29
7 p.
artikel
40 Decomposing partial orderings into chains Bogart, Kenneth P.
1970
1 p. 97-99
3 p.
artikel
41 Designs derived from permutation groups Hall Jr., Marshall
1970
1 p. 12-22
11 p.
artikel
42 Diameters in graphs Ore, Oystein
1968
1 p. 75-81
7 p.
artikel
43 Die dicke des n-dimensionalen Würfel-graphen Kleinert, Michael
1967
1 p. 10-15
6 p.
artikel
44 Directed graphs having all bisections Kelly, Paul
1968
1 p. 4-18
15 p.
artikel
45 Editorial Board 1969
1 p. i-
1 p.
artikel
46 Editorial Board 1968
1 p. i-
1 p.
artikel
47 Editorial Board 1967
1 p. CO1-
1 p.
artikel
48 Editorial Board 1968
1 p. CO1-
1 p.
artikel
49 Editorial Board 1970
1 p. CO1-
1 p.
artikel
50 Editorial Board 1966
1 p. CO1-
1 p.
artikel
51 Editorial Board 1967
1 p. CO1-
1 p.
artikel
52 Editorial Board 1969
1 p. i-
1 p.
artikel
53 Editorial Board 1970
1 p. i-
1 p.
artikel
54 Enumeration under group action: Unsolved graphical enumeration problems, IV Harary, Frank
1970
1 p. 1-11
11 p.
artikel
55 Erratum 1968
1 p. 104-
1 p.
artikel
56 Extrema concerning asymmetric graphs Quintas, Louis V.
1967
1 p. 57-82
26 p.
artikel
57 Families of Non-disjoint subsets Kleitman, Daniel J.
1966
1 p. 153-155
3 p.
artikel
58 Flows in infinite graphs Folkman, Jon
1970
1 p. 30-44
15 p.
artikel
59 Forests of labeled trees Riordan, John
1968
1 p. 90-103
14 p.
artikel
60 Graphs and composite games Smith, Cedric A.B.
1966
1 p. 51-81
31 p.
artikel
61 Hamiltonian circuits on 3-polytopes Barnette, David
1970
1 p. 54-59
6 p.
artikel
62 Heterogeneous algebras Birkhoff, Garrett
1970
1 p. 115-133
19 p.
artikel
63 Labeled trees with unlabeled end-points Harary, Frank
1969
1 p. 60-64
5 p.
artikel
64 Matching algorithms Morrison, Donald R.
1969
1 p. 20-32
13 p.
artikel
65 Maximal consistent families of triples Spencer, Joel
1968
1 p. 1-8
8 p.
artikel
66 Notes on plane partitions. I Gordon, Basil
1968
1 p. 72-80
9 p.
artikel
67 Notes on plane partitions. II Gordon, Basil
1968
1 p. 81-99
19 p.
artikel
68 Numerical calculations on the four-color problem Ore, Oystein
1970
1 p. 65-78
14 p.
artikel
69 On a min-max problem of leo moser Clements, G.F.
1968
1 p. 36-39
4 p.
artikel
70 On a paper of fox about a method for calculating the ordinary irreducible characters of symmetric groups Kerber, Adalbert
1969
1 p. 90-93
4 p.
artikel
71 On basis diagraphs Gupta, Ram Prakash
1967
1 p. 16-24
9 p.
artikel
72 On canonical bases of ideals Mann, Henry B.
1967
1 p. 71-76
6 p.
artikel
73 On constructing balanced incomplete block designs from association matrices with special reference to association schemes of two and three classes Blackwelder, William C.
1969
1 p. 15-36
22 p.
artikel
74 On free monoids partially ordered by embedding Haines, Leonard H.
1969
1 p. 94-98
5 p.
artikel
75 On hearing the shape of a drum Fisher, Michael E.
1966
1 p. 105-125
21 p.
artikel
76 On the algebraic theory of graph colorings Tutte, W.T.
1966
1 p. 15-50
36 p.
artikel
77 On the construction of certain graphs Erdös, P.
1966
1 p. 149-153
5 p.
artikel
78 On the disproof of spectral synthesis Richards, Ian
1967
1 p. 61-70
10 p.
artikel
79 On the inequality Σxiyi ≥ 1/nΣxi ·Σyi and the van der Waerden permanent conjecture Sasser, D.W.
1967
1 p. 25-33
9 p.
artikel
80 On the maximal triangle-free edge-chromatic graphs in three colors Kalbfleisch, J.G.
1968
1 p. 9-20
12 p.
artikel
81 On the non-existence of graphs with transitive generalized dicyclic groups Nowitz, Lewis A.
1968
1 p. 49-51
3 p.
artikel
82 On the number of certain lattice polygons Pólya, G.
1969
1 p. 102-105
4 p.
artikel
83 On the powers of tournament matrices Moon, J.W.
1967
1 p. 1-9
9 p.
artikel
84 On v1×v2(n, s, t) configurations Payne, S.E.
1969
1 p. 1-14
14 p.
artikel
85 Oystein Ore 1970
1 p. i-iii
nvt p.
artikel
86 Parallel minimax search for a maximum Karp, Richard M.
1968
1 p. 19-35
17 p.
artikel
87 Parity patterns on even triangulated polygons Dalkey, Norman C.
1967
1 p. 100-102
3 p.
artikel
88 Power-translation invariance in discrete groups—A characterization of finite Hamiltonian groups Emerson, William R.
1970
1 p. 6-26
21 p.
artikel
89 Probability of a pure equilibrium point in n-person games Dresher, Melvin
1970
1 p. 134-145
12 p.
artikel
90 Remarks on the van der Waerden permanent conjecture Gleason, Andrew M.
1970
1 p. 54-64
11 p.
artikel
91 Research problems 1968
1 p. 100-
1 p.
artikel
92 Research problems 1967
1 p. 104-105
2 p.
artikel
93 Shadows of finite sets Motzkin, Theodore S.
1968
1 p. 40-48
9 p.
artikel
94 Solution of the Heawood map-coloring problem—case 11 Ringel, Gerhard
1969
1 p. 71-93
23 p.
artikel
95 Some covering concepts in graphs Plummer, Michael D.
1970
1 p. 91-98
8 p.
artikel
96 Some functional equations related to binomial coefficient summation Carlitz, L.
1967
1 p. 93-97
5 p.
artikel
97 Some squared squares and rectangles Willcocks, T.H.
1967
1 p. 54-56
3 p.
artikel
98 Some theorems on the free groups of certain product varieties Baumslag, Gilbert
1967
1 p. 77-99
23 p.
artikel
99 Steiner triple systems and strongly regular graphs Aliev, I.Š.o.
1969
1 p. 33-39
7 p.
artikel
100 The degrees of permutation polynomials over finite fields Wells, Charles
1969
1 p. 49-55
7 p.
artikel
101 The distance between points in random trees Meir, A.
1970
1 p. 99-103
5 p.
artikel
102 The genus of K 12s Terry, C.M.
1967
1 p. 43-60
18 p.
artikel
103 The lexicographically least de Bruijn cycle Fredricksen, Harold
1970
1 p. 1-5
5 p.
artikel
104 The Möbius function of a lattice Crapo, Henry H.
1966
1 p. 126-131
6 p.
artikel
105 The number of classes of linearly equivalent functions Fendel, Daniel
1967
1 p. 48-53
6 p.
artikel
106 The number of faces of simplicial polytopes Riordan, John
1966
1 p. 82-95
14 p.
artikel
107 The number of graded partially ordered sets Klarner, David A.
1969
1 p. 12-19
8 p.
artikel
108 The number of latin squares of order eight Wells, Mark B.
1967
1 p. 98-99
2 p.
artikel
109 The number of score sequences in tournaments Riordan, John
1968
1 p. 87-89
3 p.
artikel
110 The number of s-dimensional faces in a complex: An analogy between the simplex and the cube Kruskal, J.B.
1969
1 p. 86-89
4 p.
artikel
111 The smallest triangle-free 4-chromatic 4-regular graph Chvátal, V.
1970
1 p. 93-94
2 p.
artikel
112 Tiling with sets of polyominoes Golomb, Solomon W.
1970
1 p. 60-71
12 p.
artikel
113 Toward a theory of crossing numbers Tutte, W.T.
1970
1 p. 45-53
9 p.
artikel
114 Uniqueness theorems in balanced incomplete block designs Stanton, R.G.
1969
1 p. 37-48
12 p.
artikel
115 Upper bounds for some Ramsey numbers Kalbfleisch, J.G.
1967
1 p. 35-42
8 p.
artikel
116 Wv paths on 3-polytopes Barnette, David
1969
1 p. 62-70
9 p.
artikel
117 Zum basisproblem der nicht in die projektive ebene einbettbaren graphen, I Wagner, K.
1970
1 p. 27-43
17 p.
artikel
                             117 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland