Volume 235, Number 1-3, May 2001
- Bernhard Korte, Jaroslav Nesetril:
Vojtech Jarni'k's work in combinatorial optimization.
1-17
- Carme Àlvarez, Josep Díaz, Maria J. Serna:
The hardness of intervalizing four colored caterpillars.
19-27
- Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu:
Efficient algorithms for graphs with few P4's.
29-51
- S. Bylka:
Local improving algorithms for large cuts in graphs with maximum degree three.
53-67
- Kathie Cameron:
Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs.
69-77
- Massimiliano Caramia, Paolo Dell'Olmo:
A lower bound on the chromatic number of Mycielski graphs.
79-86
- Jirí Fiala:
Computational complexity of covering cyclic graphs.
87-94
- Petr Hlinený:
Contact graphs of line segments are NP-complete.
95-106
- Florian Roussel, Irena Rusu:
An O(n2) algorithm to color Meyniel graphs.
107-123
- Ping Wang, Gerhard W. Dueck, S. MacMillan:
Using simulated annealing to construct extremal graphs.
125-135
- Robert Babilon:
3-colourability of Penrose kite-and-dart tilings.
137-143
- Christian Bey:
An intersection theorem for weighted sets.
145-150
- Sylvain Gravier, Michel Mollard, Charles Payan:
On the nonexistence of three-dimensional tiling in the Lee metric II.
151-157
- Izolda Gorgol:
A note on a triangle-free -- complete graph induced Ramsey number.
159-163
- Charles Laywine:
A derivation of an affine plane of order 4 from a triangle-free 3-colored K16.
165-171
- Uwe Leck:
Optimal shadows and ideals in submatrix orders.
173-187
- Ales Drápal:
Hamming distances of groups and quasi-groups.
189-197
- Shalom Eliahou, Michel Kervaire:
Restricted sums of sets of cardinality 1+p in a vector space over Fp.
199-213
- Hiroshi Era, Kenjiro Ogawa, Morimasa Tsuchiya:
On transformations of posets which have the same bound graph.
215-220
- Sergei Evdokimov, Ilia N. Ponomarenko:
Two-closure of odd permutation group in polynomial time.
221-232
- Miroslav Fiedler:
A numerical approach to long cycles in graphs and digraphs.
233-236
- Dragan Stevanovic:
Hosoya polynomial of composite graphs.
237-244
- Josep Díaz, Jordi Petit, Maria J. Serna, Luca Trevisan:
Approximating layout problems on random graphs.
245-253
- János Komlós, Gábor N. Sárközy, Endre Szemerédi:
Proof of the Alon-Yuster conjecture.
255-269
- Brendan Nagle, Vojtech Rödl:
The asymptotic number of triple systems not containing a fixed one.
271-290
- Ioan Tomescu:
On the number of graphs and h-hypergraphs with bounded diameter.
291-299
- Adam Idzik, Zsolt Tuza:
Heredity properties of connectedness in edge-coloured complete graphs.
301-306
- János Körner, Katalin Marton:
Relative capacity and dimension of graphs.
307-315
- Frantisek Matús:
Excluded minors for Boolean polymatroids.
317-321
- Ladislav Nebesky:
The set of geodesics in a graph.
323-326
- Jaroslav Nesetril, Ales Pultr:
A note on homomorphism-independent families.
327-334
- Václav Nýdl:
Graph reconstruction from subgraphs.
335-341
- Robert Sámal, Jan Vondrák:
The limit checker number of a graph.
343-347
- Bohdan Zelinka:
Periodicity of graph operators.
349-351
- Denise Amar, André Raspaud, Olivier Togni:
All-to-all wavelength-routing in all-optical compound networks.
353-363
- Elena V. Konstantinova, Vladimir A. Skorobogatov:
Application of hypergraph theory in chemistry.
365-383
- Tomoki Nakamigawa:
Nakade -- a graph theoretic concept in Go.
385-397
- Petr Pancoska, Vi't Janota, Jaroslav Nesetril:
Novel matrix descriptor for determination of the connectivity of secondary structure segments in proteins. Analysis of general properties using graph theory.
399-423
Last update Wed May 22 17:28:25 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
