Volume 223, Number 1-3, August 2000
- Peter Adams, Darryn E. Bryant, Abdollah Khodkar:
On Alspach's conjecture with two even cycle lengths.
1-12
- Armen S. Asratian:
Some results on an edge coloring problem of Folkman and Fulkerson.
13-25
- Valérie Berthé, Laurent Vuillon:
Tilings and rotations on the torus: a two-dimensional generalization of Sturmian sequences.
27-53
- Youssef Boudabbous, Jamel Dammak, Pierre Ille:
Indecomposability and duality of tournaments.
55-82
- Walter Alexandre Carnielli, Emerson L. Monte Carmelo:
K2, 2-K1, n and K2, n-K2, n bipartite Ramsey numbers.
83-92
- Amir Daneshgar, Reza Naserasr:
On small uniquely vertex-colourable graphs and Xu's conjecture.
93-108
- Anthony B. Evans, Garth Isaak, Darren A. Narayan:
Representations of graphs modulo n.
109-123
- Ting-Yem Ho, Jou-Ming Chang, Yue-Li Wang:
On the powers of graphs with bounded asteroidal number.
125-133
- David B. Jaffe:
Optimal binary linear codes of length leq 30.
135-155
- William Klostermeyer, Lubomír Soltés:
An extremal connectivity parameter of tournaments.
157-173
- Gunter Lassmann, Eric Sparla:
A classification of centrally-symmetric and cyclic 12-vertex triangulations of S2?S2.
175-187
- Heather A. Lewis:
Homotopy in Q-polynomial distance-regular graphs.
189-206
- Rao Li, Richard H. Schelp:
Some hamiltonian properties of L1-graphs.
207-216
- Johann Linhart, Yanling Yang, Martin Philipp:
Arrangements of hemispheres and halfspaces.
217-226
- Colin J. H. McDiarmid:
Frequency-distance constraints with large distances.
227-251
- Patric R. J. Östergård:
Classification of binary/ternary one-error-correcting codes.
253-262
- Erich Prisner:
Recognizing random intersection graphs.
263-274
- Han Ren, Yanpei Liu:
Bisingular maps on the sphere and the projective plane.
275-285
- Ioan Tomescu:
On the number of large h-hypergraphs with a fixed diameter.
287-297
- Pou-Lin Wu:
Extremal graphs with prescribed circumference and cocircumference.
299-308
- Jin Xu, C. K. Wong:
Self-complementary graphs and Ramsey numbers Part I: the decomposition and construction of self-complementary graphs.
309-326
- Shenggui Zhang, Xueliang Li, Hajo Broersma:
Heavy paths and cycles in weighted graphs.
327-336
- Yuanping Zhang, Xuerong Yong, Mordecai J. Golin:
The number of spanning trees in circulant graphs.
337-350
- Yong-Gao Chen:
On sums and intersects of sequences.
351-354
- Nicolas Chevallier:
Three distance theorem and grid graph.
355-362
- Vladimir Estivill-Castro, Marc Noy, Jorge Urrutia:
On the chromatic number of tree graphs.
363-366
- Stefano Galatolo:
A proof of the Beyer-Stein-Ulam relation between complexity and entropy.
367-372
- Masaaki Harada:
On the existence of extremal Type II codes over Z6.
373-378
- Weimin Li:
Idempotent endomorphisms of a graph.
379-386
- Terry A. McKee:
Induced cycle structure and outerplanarity.
387-392
- Kazuhiko Ushio, Yoshikazu Ohtsubo:
Ck-factorization of symmetric complete bipartite and tripartite multi-digraphs.
393-397
Last update Tue May 21 18:48:11 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
