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
 
                             49 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A Diophantine problem of Frobenius in terms of the least common multiple Raczunas, Marek
1996
150 1-3 p. 347-357
11 p.
artikel
2 A linear time algorithm for edge coloring of binomial trees Kubale, M.
1996
150 1-3 p. 247-256
10 p.
artikel
3 An exact construction of digital convex polygons with minimal diameter Matić-Kekić, Sneẑana
1996
150 1-3 p. 303-313
11 p.
artikel
4 A nonhamiltonian five-regular multitriangular polyhedral graph Walther, Hansjoachim
1996
150 1-3 p. 387-392
6 p.
artikel
5 Another six-coloring of the plane Hoffman, Ilya
1996
150 1-3 p. 427-429
3 p.
artikel
6 Applications of hypergraph coloring to coloring graphs not inducing certain trees Kierstead, H.A.
1996
150 1-3 p. 187-193
7 p.
artikel
7 A Ramsey-type problem on right-angled triangles in space Bóna, Miklós
1996
150 1-3 p. 61-67
7 p.
artikel
8 Atoms of set systems with a fixed number of pairwise unions Haxell, P.E.
1996
150 1-3 p. 155-166
12 p.
artikel
9 Author index to volume 150 (1996) 1996
150 1-3 p. 461-462
2 p.
artikel
10 Characterization of Laborde-Mulder graphs (extended odd graphs) Madani, Rafaï-Mourad
1996
150 1-3 p. 293-301
9 p.
artikel
11 Choosability of planar graphs Voigt, Margit
1996
150 1-3 p. 457-460
4 p.
artikel
12 Covering and independence in triangle structures Erdös, Paul
1996
150 1-3 p. 89-101
13 p.
artikel
13 Cycle-saturated graphs of minimum size Barefoot, C.A.
1996
150 1-3 p. 31-48
18 p.
artikel
14 Decomposition of some planar graphs into trees Petrović, Vojislav
1996
150 1-3 p. 449-451
3 p.
artikel
15 Degrees in a digraph whose nodes are graphs Balińska, Krystyna T.
1996
150 1-3 p. 17-29
13 p.
artikel
16 Editorial Board 1996
150 1-3 p. IFC-
1 p.
artikel
17 Extending matchings in planar graphs V Plummer, Michael D.
1996
150 1-3 p. 315-324
10 p.
artikel
18 Extremal functions for sequences Klazar, Martin
1996
150 1-3 p. 195-203
9 p.
artikel
19 Furthest neighbours in space Csizmadia, György
1996
150 1-3 p. 81-88
8 p.
artikel
20 Graceful valuations of 2-regular graphs with two components Abrham, Jaromir
1996
150 1-3 p. 3-15
13 p.
artikel
21 Graph spectra Faudree, R.J.
1996
150 1-3 p. 103-113
11 p.
artikel
22 Hilbert bases of cuts Laurent, Monique
1996
150 1-3 p. 257-279
23 p.
artikel
23 Large 2P 3-free graphs with bounded degree Chung, Myung S.
1996
150 1-3 p. 69-79
11 p.
artikel
24 Least domination in a graph Favaron, Odile
1996
150 1-3 p. 115-122
8 p.
artikel
25 Lower bounds for the size in four families of minimum broadcast graphs Saclé, J.-F.
1996
150 1-3 p. 359-369
11 p.
artikel
26 On a straight-line embedding problem of graphs Tokunaga, Shin-ichi
1996
150 1-3 p. 371-378
8 p.
artikel
27 On fully extended self-avoiding polygons Miklós, Dezső
1996
150 1-3 p. 437-440
4 p.
artikel
28 On Matula numbers Gutman, Ivan
1996
150 1-3 p. 131-142
12 p.
artikel
29 On product of association schemes and Shannon capacity Miklós, Dezső
1996
150 1-3 p. 441-447
7 p.
artikel
30 On some properties of the series ∑ k=0 ∞ k n x k and the Stirling numbers of the second kind Lengyel, Tamás
1996
150 1-3 p. 281-292
12 p.
artikel
31 On the degree of regularity of some equations Bialostocki, Arie
1996
150 1-3 p. 49-60
12 p.
artikel
32 On the Erdős-diameter of sets Brass, Peter
1996
150 1-3 p. 415-419
5 p.
artikel
33 On the minimal reducible bound for outerplanar and planar graphs Mihók, Peter
1996
150 1-3 p. 431-435
5 p.
artikel
34 On the number of flats spanned by a set of points in PG(d, q) Boros, Endre
1996
150 1-3 p. 407-409
3 p.
artikel
35 On the number of irreducible coverings by edges of complete bipartite graphs Tomescu, Ioan
1996
150 1-3 p. 453-456
4 p.
artikel
36 On the on-line chromatic number of the family of on-line 3-chromatic graphs Kolossa, Katalin
1996
150 1-3 p. 205-230
26 p.
artikel
37 On the weak reconstruction of Cartesian-product graphs Imrich, Wilfried
1996
150 1-3 p. 167-178
12 p.
artikel
38 Packing three trees Woźniak, Mariusz
1996
150 1-3 p. 393-402
10 p.
artikel
39 Polynomial identities from weighted lattice path counting Buzeţeanu, Şerban N.
1996
150 1-3 p. 421-425
5 p.
artikel
40 Preface Hajnal, A.
1996
150 1-3 p. 1-
1 p.
artikel
41 5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one Harant, J.
1996
150 1-3 p. 143-153
11 p.
artikel
42 Stable graphs for a family of endomorphisms Polat, Norbert
1996
150 1-3 p. 325-335
11 p.
artikel
43 The bandwidth of a tree with k leaves is at most [ k 2 ] Ando, Kiyoshi
1996
150 1-3 p. 403-406
4 p.
artikel
44 The cross number of finite abelian groups III Geroldinger, Alfred
1996
150 1-3 p. 123-130
8 p.
artikel
45 The Erdős-Sós conjecture for graphs of girth 5 Brandt, Stephan
1996
150 1-3 p. 411-414
4 p.
artikel
46 The irregularity strength and cost of the union of cliques Jendroľ, Stanislav
1996
150 1-3 p. 179-186
8 p.
artikel
47 The two largest distances in finite planar sets Vesztergombi, Katalin
1996
150 1-3 p. 379-386
8 p.
artikel
48 Toughness, hamiltonicity and split graphs Kratsch, Dieter
1996
150 1-3 p. 231-245
15 p.
artikel
49 Une méthode d'énumération des cycles négatifs d'un graphe signé Popescu, Dragoş-Radu
1996
150 1-3 p. 337-345
9 p.
artikel
                             49 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland