| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A graph-theoretical characterization of the order complexes on the 2-sphere
|
Hibi, Takayuki
|
|
|
72 |
1-3 |
p. 167-174
|
artikel
|
| 2 |
An algorithm for solving the jump number problem
|
Sysło, Maciej M.
|
|
|
72 |
1-3 |
p. 337-346
|
artikel
|
| 3 |
An existential problem of a weight- controlled subset and its application to school timetable construction
|
Kitagawa, Fumio
|
|
|
72 |
1-3 |
p. 195-211
|
artikel
|
| 4 |
A result on generalized latin rectangles
|
Deng, Chai-Ling
|
|
|
72 |
1-3 |
p. 71-80
|
artikel
|
| 5 |
A solution to the Misère Shannon switching Game
|
Hamidoune, Yahya Ould
|
|
|
72 |
1-3 |
p. 163-166
|
artikel
|
| 6 |
Author index
|
|
|
|
72 |
1-3 |
p. 417-418
|
artikel
|
| 7 |
Bipartite graphs obtained from adjacency matrices of orientations of graphs
|
Reid, K.B.
|
|
|
72 |
1-3 |
p. 321-330
|
artikel
|
| 8 |
Chromatic polynomials of generalized trees
|
Whitehead Jr., Earl Glen
|
|
|
72 |
1-3 |
p. 391-393
|
artikel
|
| 9 |
Clique partitions and clique coverings
|
Erdöos, Paul
|
|
|
72 |
1-3 |
p. 93-101
|
artikel
|
| 10 |
Cn -factors of group graphs
|
Ruiz, Mari-Jo P.
|
|
|
72 |
1-3 |
p. 331-336
|
artikel
|
| 11 |
Combinatorial resolution of systems of differential equations. IV. separation of variables
|
Leroux, Pierre
|
|
|
72 |
1-3 |
p. 237-250
|
artikel
|
| 12 |
Computation of some Cayley diagrams
|
Miyamoto, Izumi
|
|
|
72 |
1-3 |
p. 291-293
|
artikel
|
| 13 |
Constructions of sensitive graphs which are not strongly sensitive
|
Koh, K.M.
|
|
|
72 |
1-3 |
p. 225-236
|
artikel
|
| 14 |
Doubly regular asymmetric digraphs
|
Ito, Noboru
|
|
|
72 |
1-3 |
p. 181-185
|
artikel
|
| 15 |
Edge-packing of graphs and network reliability
|
Colbourn, Charles J.
|
|
|
72 |
1-3 |
p. 49-61
|
artikel
|
| 16 |
Editorial Board
|
|
|
|
72 |
1-3 |
p. ii
|
artikel
|
| 17 |
Enumerating phylogenetic trees with multiple labels
|
Foulds, L.R.
|
|
|
72 |
1-3 |
p. 129-139
|
artikel
|
| 18 |
Explicit construction of linear sized tolerant networks
|
Alon, N.
|
|
|
72 |
1-3 |
p. 15-19
|
artikel
|
| 19 |
Extremal theory and bipartite graph-tree Ramsey numbers
|
Erdöos, P.
|
|
|
72 |
1-3 |
p. 103-112
|
artikel
|
| 20 |
Gallai theorems for graphs, hypergraphs, and set systems
|
Cockayne, E.J.
|
|
|
72 |
1-3 |
p. 35-47
|
artikel
|
| 21 |
Generalizations of critical connectivity of graphs
|
Mader, W.
|
|
|
72 |
1-3 |
p. 267-283
|
artikel
|
| 22 |
Hard graphs for the maximum clique problem
|
Hoede, Cornelis
|
|
|
72 |
1-3 |
p. 175-179
|
artikel
|
| 23 |
Highly irregular m-chromatic graphs
|
Alavi, Yousef
|
|
|
72 |
1-3 |
p. 3-13
|
artikel
|
| 24 |
Labeling angles of planar graphs
|
Loupekine, Feodor
|
|
|
72 |
1-3 |
p. 251-256
|
artikel
|
| 25 |
Large scale network analysis with applications to transportation, communication and inference networks
|
Teh, Hoon Heng
|
|
|
72 |
1-3 |
p. 347-353
|
artikel
|
| 26 |
Maximal induced trees in sparse random graphs
|
łuczak, Tomasz
|
|
|
72 |
1-3 |
p. 257-265
|
artikel
|
| 27 |
More non-reconstructible hypergraphs
|
Kocay, W.L.
|
|
|
72 |
1-3 |
p. 213-224
|
artikel
|
| 28 |
n-Graphs
|
Vince, Andrew
|
|
|
72 |
1-3 |
p. 367-380
|
artikel
|
| 29 |
On conjectures of Graffiti
|
Fajtlowicz, Siemion
|
|
|
72 |
1-3 |
p. 113-118
|
artikel
|
| 30 |
On edge-Hamiltonian property of Cayley graphs
|
Chen, C.C.
|
|
|
72 |
1-3 |
p. 29-33
|
artikel
|
| 31 |
On point-linear arboricity of planar graphs
|
Wang, Jianfang
|
|
|
72 |
1-3 |
p. 381-384
|
artikel
|
| 32 |
On the euclidean dimension of a complete multipartite graph
|
Maehara, Hiroshi
|
|
|
72 |
1-3 |
p. 285-289
|
artikel
|
| 33 |
On the Littlewood-Richardson rule in terms of lattice path combinatorics
|
Watanabe, Toshihiro
|
|
|
72 |
1-3 |
p. 385-390
|
artikel
|
| 34 |
On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
|
Ueno, Shuichi
|
|
|
72 |
1-3 |
p. 355-360
|
artikel
|
| 35 |
Ordering of the elements of a matroid such that its consecutive w elements are independent
|
Kajitani, Yoji
|
|
|
72 |
1-3 |
p. 187-194
|
artikel
|
| 36 |
Packing of graphs—a survey
|
Yap, H.P.
|
|
|
72 |
1-3 |
p. 395-404
|
artikel
|
| 37 |
P 3-Factorization of complete bipartite graphs
|
Ushio, Kazuhiko
|
|
|
72 |
1-3 |
p. 361-366
|
artikel
|
| 38 |
Preface
|
Akiyama, Jin
|
|
|
72 |
1-3 |
p. 1-2
|
artikel
|
| 39 |
Problems and results in combinatorial analysis and graph theory
|
Erdős, Paul
|
|
|
72 |
1-3 |
p. 81-92
|
artikel
|
| 40 |
Problems on chain partitions
|
Griggs, Jerrold R.
|
|
|
72 |
1-3 |
p. 157-162
|
artikel
|
| 41 |
Score sequences: Lexicographic enumeration and tournament construction
|
Gervacio, S.V.
|
|
|
72 |
1-3 |
p. 151-155
|
artikel
|
| 42 |
Short cycles in digraphs
|
Nishimura, Tsuyoshi
|
|
|
72 |
1-3 |
p. 295-298
|
artikel
|
| 43 |
Small order graph-tree Ramsey numbers
|
Faudree, R.J.
|
|
|
72 |
1-3 |
p. 119-127
|
artikel
|
| 44 |
Sorting in rounds
|
Bollobás, Béla
|
|
|
72 |
1-3 |
p. 21-28
|
artikel
|
| 45 |
Subgraph counts in random graphs using incomplete u-statistics methods
|
Nowicki, Krzysztof
|
|
|
72 |
1-3 |
p. 299-310
|
artikel
|
| 46 |
Toughness and matching extension in graphs
|
Plummer, M.D.
|
|
|
72 |
1-3 |
p. 311-320
|
artikel
|
| 47 |
Triad count statistics
|
Frank, Ove
|
|
|
72 |
1-3 |
p. 141-149
|
artikel
|
| 48 |
Two hamilton cycles in bipartite reflective kneser graphs
|
Dejter, I.J.
|
|
|
72 |
1-3 |
p. 63-70
|
artikel
|
| 49 |
Z-transformation graphs of perfect matchings of hexagonal systems
|
Fu-ji, Zhang
|
|
|
72 |
1-3 |
p. 405-415
|
artikel
|
Tijdschrift beschrijving