nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An elementary proof of Moon's theorem on generalized tournaments
|
Bang, Chang M |
|
1977 |
22 |
3 |
p. 299-301 3 p. |
artikel |
2 |
A note on a paper of G. Wegner
|
Wong, Pak-Ken |
|
1977 |
22 |
3 |
p. 302-303 2 p. |
artikel |
3 |
A note on P(− λ; G)
|
Wilf, Herbert S |
|
1977 |
22 |
3 |
p. 296- 1 p. |
artikel |
4 |
A note on the production of matroid minors
|
Seymour, P.D |
|
1977 |
22 |
3 |
p. 289-295 7 p. |
artikel |
5 |
Author index for volume 22
|
|
|
1977 |
22 |
3 |
p. 304- 1 p. |
artikel |
6 |
Automorphisms and cohomology of switching classes
|
Cameron, Peter J |
|
1977 |
22 |
3 |
p. 297-298 2 p. |
artikel |
7 |
Circuits containing specified edges
|
Woodall, D.R |
|
1977 |
22 |
3 |
p. 274-278 5 p. |
artikel |
8 |
Disjoint matchings of graphs
|
Lebensold, Kenneth |
|
1977 |
22 |
3 |
p. 207-210 4 p. |
artikel |
9 |
Every connected regular graph of even degree is a Schreier coset graph
|
Gross, Jonathan L |
|
1977 |
22 |
3 |
p. 227-232 6 p. |
artikel |
10 |
Graphs in which each m-tuple of vertices is adjacent to the same number n of other vertices
|
Carstens, Hans Georg |
|
1977 |
22 |
3 |
p. 286-288 3 p. |
artikel |
11 |
Note on circuits containing specified edges
|
Thomassen, Carsten |
|
1977 |
22 |
3 |
p. 279-280 2 p. |
artikel |
12 |
On n-Hamiltonian line graphs
|
Lesniak-Foster, Linda |
|
1977 |
22 |
3 |
p. 263-273 11 p. |
artikel |
13 |
On the existence of k-separated finite and infinite dipaths
|
Horváth, Sándor |
|
1977 |
22 |
3 |
p. 284-285 2 p. |
artikel |
14 |
On the uniqueness of the tetrahedral association schemes
|
Liebler, Robert A |
|
1977 |
22 |
3 |
p. 246-262 17 p. |
artikel |
15 |
Regular graphs with high edge degree
|
Sprague, Alan P |
|
1977 |
22 |
3 |
p. 199-206 8 p. |
artikel |
16 |
Sur les R-coloriages minimaux
|
Giraud, Guy |
|
1977 |
22 |
3 |
p. 211-226 16 p. |
artikel |
17 |
The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular
|
Kundu, Sukhamay |
|
1977 |
22 |
3 |
p. 233-245 13 p. |
artikel |
18 |
The edge reconstruction hypothesis is true for graphs with more than n · log2 n edges
|
Müller, Vladimír |
|
1977 |
22 |
3 |
p. 281-283 3 p. |
artikel |