|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
35 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A new invariant of plane bipartite cubic graphs |
Jaeger, François |
1992 |
101 | 1-3 |
p. 149-164 16 p. |
artikel |
|
| 2 | An extension of the multi-path algorithm for finding hamilton cycles |
Kocay, William |
1992 |
101 | 1-3 |
p. 171-188 18 p. |
artikel |
|
| 3 | An inequality for chromatic polynomials |
Woodall, D.R. |
1992 |
101 | 1-3 |
p. 327-331 5 p. |
artikel |
|
| 4 | A quick proof that K 10 ≠ P + P + P |
Hanson, Denis |
1992 |
101 | 1-3 |
p. 107-108 2 p. |
artikel |
|
| 5 | A solution to a colouring problem of P. Erdős |
Fleischner, Herbert |
1992 |
101 | 1-3 |
p. 39-48 10 p. |
artikel |
|
| 6 | Author index to volume 101 (1992) |
1992 |
101 | 1-3 |
p. 363-364 2 p. |
artikel |
||
| 7 | A zero-free interval for chromatic polynomials |
Woodall, D.R. |
1992 |
101 | 1-3 |
p. 333-341 9 p. |
artikel |
|
| 8 | Binary invariants and orientations of graphs |
Sabidussi, Gert |
1992 |
101 | 1-3 |
p. 251-277 27 p. |
artikel |
|
| 9 | Coflow polyhedra |
Cameron, Kathie |
1992 |
101 | 1-3 |
p. 1-21 21 p. |
artikel |
|
| 10 | Colorful induced subgraphs |
Kierstead, H.A. |
1992 |
101 | 1-3 |
p. 165-169 5 p. |
artikel |
|
| 11 | Conjecture de Hadwiger: k = 6. II—réductions de sommets de degré 6 dans les graphes 6- chromatiques contraction-critiques |
Mayer, Jean |
1992 |
101 | 1-3 |
p. 213-222 10 p. |
artikel |
|
| 12 | Cycles containing many vertices of large degree |
Veldman, H.J. |
1992 |
101 | 1-3 |
p. 319-325 7 p. |
artikel |
|
| 13 | Cycles of length 2 modulo 3 in graphs |
Saito, Akira |
1992 |
101 | 1-3 |
p. 285-289 5 p. |
artikel |
|
| 14 | Editorial Board |
1992 |
101 | 1-3 |
p. v-vii nvt p. |
artikel |
||
| 15 | Enumeration of regular graphs 100 years ago |
Gropp, Harald |
1992 |
101 | 1-3 |
p. 73-85 13 p. |
artikel |
|
| 16 | Extremal problems involving vertices and edges on odd cycles |
Erdős, P. |
1992 |
101 | 1-3 |
p. 23-31 9 p. |
artikel |
|
| 17 | Gallai's problem on Dirac's construction |
Youngs, D.A. |
1992 |
101 | 1-3 |
p. 343-350 8 p. |
artikel |
|
| 18 | Hajós' conjecture and small cycle double covers of planar graphs |
Seyffarth, Karen |
1992 |
101 | 1-3 |
p. 291-306 16 p. |
artikel |
|
| 19 | How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs |
Sachs, Horst |
1992 |
101 | 1-3 |
p. 279-284 6 p. |
artikel |
|
| 20 | Indecomposable regular graphs and hypergraphs |
Füredi, Zoltán |
1992 |
101 | 1-3 |
p. 59-64 6 p. |
artikel |
|
| 21 | List edge chromatic number of graphs with large girth |
Kostochka, A.V. |
1992 |
101 | 1-3 |
p. 189-201 13 p. |
artikel |
|
| 22 | On a theorem of Mader |
Frank, András |
1992 |
101 | 1-3 |
p. 49-57 9 p. |
artikel |
|
| 23 | On cages with given degree sets |
Hanson, Denis |
1992 |
101 | 1-3 |
p. 109-114 6 p. |
artikel |
|
| 24 | On 3-connected graphs with contractible edge covers of size k |
Hemminger, Robert L. |
1992 |
101 | 1-3 |
p. 115-133 19 p. |
artikel |
|
| 25 | On Hadwiger's number— a problem of the Nordhaus-Gaddum type |
Stiebitz, M. |
1992 |
101 | 1-3 |
p. 307-317 11 p. |
artikel |
|
| 26 | On Ramsey graphs without bipartite subgraphs |
Nešetřil, Jaroslav |
1992 |
101 | 1-3 |
p. 223-229 7 p. |
artikel |
|
| 27 | On the r-domination number of a graph |
Griggs, Jerrold R. |
1992 |
101 | 1-3 |
p. 65-72 8 p. |
artikel |
|
| 28 | Plurality preference digraphs realized by trees, II: on realization numbers |
Reid, K.B. |
1992 |
101 | 1-3 |
p. 231-249 19 p. |
artikel |
|
| 29 | Some finiteness results concerning separation in graphs |
Halin, R. |
1992 |
101 | 1-3 |
p. 97-106 10 p. |
artikel |
|
| 30 | Spanning eularian subgraphs, the splitting Lemma, and Petersen's theorem |
Fleischner, Herbert |
1992 |
101 | 1-3 |
p. 33-37 5 p. |
artikel |
|
| 31 | T-colorings of graphs |
Liu, Daphne Der-Fen |
1992 |
101 | 1-3 |
p. 203-212 10 p. |
artikel |
|
| 32 | The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable |
Györi, E. |
1992 |
101 | 1-3 |
p. 87-96 10 p. |
artikel |
|
| 33 | The chromatic index of a graph whose core has maximum degree two |
Hilton, A.J.W. |
1992 |
101 | 1-3 |
p. 135-147 13 p. |
artikel |
|
| 34 | The road to wisdom?-Well, it's plain and simple to express: err and err and err again but less and less and less. |
Hein, Piet |
1992 |
101 | 1-3 |
p. 361- 1 p. |
artikel |
|
| 35 | Unsolved problems presented at the Julius Petersen Graph Theory Conference |
Bang-Jensen, Jørgen |
1992 |
101 | 1-3 |
p. 351-360 10 p. |
artikel |
35 gevonden resultaten