Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             35 results found
no title author magazine year volume issue page(s) type
1 A brief survey of perfect Mendelsohn packing and covering designs Bennett, F.E.
1999
95 1-3 p. 73-81
9 p.
article
2 Almost diameter of a house-hole-free graph in linear time via LexBFS Dragan, Feodor F.
1999
95 1-3 p. 223-239
17 p.
article
3 A new sufficient condition for a digraph to be Hamiltonian Bang-Jensen, Jorgen
1999
95 1-3 p. 61-72
12 p.
article
4 An upper bound for the size of the largest antichain in the poset of partitions of an integer Rodney Canfield, E.
1999
95 1-3 p. 169-180
12 p.
article
5 Asymptotic results on suborthogonal G → -decompositions of complete digraphs Hartmann, Sven
1999
95 1-3 p. 311-320
10 p.
article
6 Covering t-sets with (t+2)-sets Nurmela, Kari J.
1999
95 1-3 p. 425-437
13 p.
article
7 Critical edges in perfect line graphs and some polyhedral consequences Wagler, Annegret
1999
95 1-3 p. 455-466
12 p.
article
8 Editorial 1999
95 1-3 p. 1-
1 p.
article
9 Graph classes between parity and distance-hereditary graphs Cicerone, Serafino
1999
95 1-3 p. 197-216
20 p.
article
10 Index 1999
95 1-3 p. 467-468
2 p.
article
11 Matching-star Ramsey sets Mengersen, Ingrid
1999
95 1-3 p. 417-424
8 p.
article
12 Note on a helicopter search problem on graphs Fomin, Fedor V.
1999
95 1-3 p. 241-249
9 p.
article
13 On an isoperimetric problem for Hamming graphs Harper, L.H.
1999
95 1-3 p. 285-309
25 p.
article
14 On k-partitioning of Hamming graphs Bezrukov, S.L.
1999
95 1-3 p. 127-140
14 p.
article
15 On maximal shadows of members in left-compressed sets Ahlswede, Rudolf
1999
95 1-3 p. 3-9
7 p.
article
16 On the complexity of hamiltonian path and cycle problems in certain classes of digraphs Bang-Jensen, Jørgen
1999
95 1-3 p. 41-60
20 p.
article
17 On the Complexity of Linear Programming in the BSS-model Bär, G.
1999
95 1-3 p. 35-40
6 p.
article
18 On the extension of bipartite to parity graphs Cicerone, Serafino
1999
95 1-3 p. 181-195
15 p.
article
19 On the linear relaxation of the 2-node connected subgraph polytope Mahjoub, A.R
1999
95 1-3 p. 389-416
28 p.
article
20 On the PBD-closure of sets containing 3 Grüttmüller, M.
1999
95 1-3 p. 251-272
22 p.
article
21 On the p-connectedness of graphs – a survey Babel, Luitpold
1999
95 1-3 p. 11-33
23 p.
article
22 On the stability number of claw-free P 5-free and more general graphs Brandstädt, Andreas
1999
95 1-3 p. 163-167
5 p.
article
23 On trades: an update Khosrovshahi, G.B.
1999
95 1-3 p. 361-376
16 p.
article
24 Orthogonal double covers of complete graphs by trees of small diameter Leck, Uwe
1999
95 1-3 p. 377-388
12 p.
article
25 Outpaths in semicomplete multipartite digraphs Guo, Yubao
1999
95 1-3 p. 273-277
5 p.
article
26 Partitions and network reliability Tittmann, Peter
1999
95 1-3 p. 445-453
9 p.
article
27 Perfect and almost perfect sequences Jungnickel, Dieter
1999
95 1-3 p. 331-359
29 p.
article
28 Recognizing graphs of acyclic cubical complexes Imrich, Wilfried
1999
95 1-3 p. 321-330
10 p.
article
29 Simple 8-(40,11,1440) designs Betten, Anton
1999
95 1-3 p. 109-114
6 p.
article
30 Suborthogonal double covers of the complete graph by stars Schumacher, Ulrike
1999
95 1-3 p. 439-444
6 p.
article
31 The Erdős-Ko-Rado bound for the function lattice Bey, Christian
1999
95 1-3 p. 115-125
11 p.
article
32 The proper linear spaces on 17 points Betten, A
1999
95 1-3 p. 83-108
26 p.
article
33 The Steiner ratio of L 2k d Cieslik, Dietmar
1999
95 1-3 p. 217-221
5 p.
article
34 Tree- and forest-perfect graphs Brandstädt, Andreas
1999
95 1-3 p. 141-162
22 p.
article
35 Weakened Ramsey numbers Harborth, Heiko
1999
95 1-3 p. 279-284
6 p.
article
                             35 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands