|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
39 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A derivation of an affine plane of order 4 from a triangle-free 3-colored K 16 |
Laywine, Charles F. |
2001 |
235 | 1-3 |
p. 165-171 7 p. |
artikel |
|
| 2 | All-to-all wavelength-routing in all-optical compound networks |
Amar, D. |
2001 |
235 | 1-3 |
p. 353-363 11 p. |
artikel |
|
| 3 | A lower bound on the chromatic number of Mycielski graphs |
Caramia, Massimiliano |
2001 |
235 | 1-3 |
p. 79-86 8 p. |
artikel |
|
| 4 | An intersection theorem for weighted sets |
Bey, C. |
2001 |
235 | 1-3 |
p. 145-150 6 p. |
artikel |
|
| 5 | An O(n 2) algorithm to color Meyniel graphs |
Roussel, F. |
2001 |
235 | 1-3 |
p. 107-123 17 p. |
artikel |
|
| 6 | A note on a triangle-free — complete graph induced Ramsey number |
Gorgol, Izolda |
2001 |
235 | 1-3 |
p. 159-163 5 p. |
artikel |
|
| 7 | A note on homomorphism-independent families |
Nešetřil, J |
2001 |
235 | 1-3 |
p. 327-334 8 p. |
artikel |
|
| 8 | A numerical approach to long cycles in graphs and digraphs |
Fiedler, Miroslav |
2001 |
235 | 1-3 |
p. 233-236 4 p. |
artikel |
|
| 9 | Application of hypergraph theory in chemistry |
Konstantinova, Elena V. |
2001 |
235 | 1-3 |
p. 365-383 19 p. |
artikel |
|
| 10 | Approximating layout problems on random graphs |
Dı́az, Josep |
2001 |
235 | 1-3 |
p. 245-253 9 p. |
artikel |
|
| 11 | Author index |
2001 |
235 | 1-3 |
p. 425-426 2 p. |
artikel |
||
| 12 | 3-colourability of Penrose kite-and-dart tilings |
Babilon, Robert |
2001 |
235 | 1-3 |
p. 137-143 7 p. |
artikel |
|
| 13 | Computational complexity of covering cyclic graphs |
Fiala, Jiřı́ |
2001 |
235 | 1-3 |
p. 87-94 8 p. |
artikel |
|
| 14 | Contact graphs of line segments are NP-complete |
Hliněný, Petr |
2001 |
235 | 1-3 |
p. 95-106 12 p. |
artikel |
|
| 15 | Efficient algorithms for graphs with few P 4's |
Babel, Luitpold |
2001 |
235 | 1-3 |
p. 29-51 23 p. |
artikel |
|
| 16 | Excluded minors for Boolean polymatroids |
Matúš, František |
2001 |
235 | 1-3 |
p. 317-321 5 p. |
artikel |
|
| 17 | Graph reconstruction from subgraphs |
Nýdl, Václav |
2001 |
235 | 1-3 |
p. 335-341 7 p. |
artikel |
|
| 18 | Hamming distances of groups and quasi-groups |
Drápal, Aleš |
2001 |
235 | 1-3 |
p. 189-197 9 p. |
artikel |
|
| 19 | Heredity properties of connectedness in edge-coloured complete graphs |
Idzik, Adam |
2001 |
235 | 1-3 |
p. 301-306 6 p. |
artikel |
|
| 20 | Hosoya polynomial of composite graphs |
Stevanović, Dragan |
2001 |
235 | 1-3 |
p. 237-244 8 p. |
artikel |
|
| 21 | Local improving algorithms for large cuts in graphs with maximum degree three |
Bylka, S. |
2001 |
235 | 1-3 |
p. 53-67 15 p. |
artikel |
|
| 22 | Nakade — a graph theoretic concept in Go |
Nakamigawa, Tomoki |
2001 |
235 | 1-3 |
p. 385-397 13 p. |
artikel |
|
| 23 | Novel matrix descriptor for determination of the connectivity of secondary structure segments in proteins. Analysis of general properties using graph theory |
Pančoška, Petr |
2001 |
235 | 1-3 |
p. 399-423 25 p. |
artikel |
|
| 24 | On the nonexistence of three-dimensional tiling in the Lee metric II |
Gravier, Sylvain |
2001 |
235 | 1-3 |
p. 151-157 7 p. |
artikel |
|
| 25 | On the number of graphs and h-hypergraphs with bounded diameter |
Tomescu, Ioan |
2001 |
235 | 1-3 |
p. 291-299 9 p. |
artikel |
|
| 26 | On transformations of posets which have the same bound graph |
Era, Hiroshi |
2001 |
235 | 1-3 |
p. 215-220 6 p. |
artikel |
|
| 27 | Optimal shadows and ideals in submatrix orders |
Leck, Uwe |
2001 |
235 | 1-3 |
p. 173-187 15 p. |
artikel |
|
| 28 | Periodicity of graph operators |
Zelinka, Bohdan |
2001 |
235 | 1-3 |
p. 349-351 3 p. |
artikel |
|
| 29 | Proof of the Alon–Yuster conjecture |
Komlós, János |
2001 |
235 | 1-3 |
p. 255-269 15 p. |
artikel |
|
| 30 | Relative capacity and dimension of graphs |
Körner, J. |
2001 |
235 | 1-3 |
p. 307-315 9 p. |
artikel |
|
| 31 | Restricted sums of sets of cardinality 1+p in a vector space over F p |
Eliahou, Shalom |
2001 |
235 | 1-3 |
p. 199-213 15 p. |
artikel |
|
| 32 | The asymptotic number of triple systems not containing a fixed one |
Nagle, Brendan |
2001 |
235 | 1-3 |
p. 271-290 20 p. |
artikel |
|
| 33 | The hardness of intervalizing four colored caterpillars |
Àlvarez, C. |
2001 |
235 | 1-3 |
p. 19-27 9 p. |
artikel |
|
| 34 | The limit checker number of a graph |
Šámal, Robert |
2001 |
235 | 1-3 |
p. 343-347 5 p. |
artikel |
|
| 35 | The set of geodesics in a graph |
Nebeský, Ladislav |
2001 |
235 | 1-3 |
p. 323-326 4 p. |
artikel |
|
| 36 | Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs |
Cameron, Kathie |
2001 |
235 | 1-3 |
p. 69-77 9 p. |
artikel |
|
| 37 | Two-closure of odd permutation group in polynomial time |
Evdokimov, Sergei |
2001 |
235 | 1-3 |
p. 221-232 12 p. |
artikel |
|
| 38 | Using simulated annealing to construct extremal graphs |
Wang, P. |
2001 |
235 | 1-3 |
p. 125-135 11 p. |
artikel |
|
| 39 | Vojtěch Jarnı́k's work in combinatorial optimization |
Korte, Bernhard |
2001 |
235 | 1-3 |
p. 1-17 17 p. |
artikel |
39 gevonden resultaten