Volume 164,
Numbers 1-3,
February 1997
The second Krakow conference of graph theory
- Anna Rycerz, A. Pawel Wojda, Mariusz Wozniak:
Preface.
1-4
Electronic Edition (link) BibTeX
- Jørgen Bang-Jensen, Gregory Gutin:
Paths and cycles in extended and decomposable digraphs, .
5-19
Electronic Edition (link) BibTeX
- Halina Bielak:
Chromatic uniqueness in a family of 2-connected graphs.
21-28
Electronic Edition (link) BibTeX
- H. J. Broersma:
A note on the minimum size of a vertex pancyclic graph.
29-32
Electronic Edition (link) BibTeX
- Stanislaw Bylka, Jan Komar:
Intersection properties of line graphs.
33-45
Electronic Edition (link) BibTeX
- Yair Caro, Yehuda Roditty, J. Schönheim:
On colored designs - I.
47-65
Electronic Edition (link) BibTeX
- Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza:
Efficiency and effectiveness of normal schedules on three dedicated processors.
67-79
Electronic Edition (link) BibTeX
- Paul Erdös:
Some recent problems and results in graph theory.
81-85
Electronic Edition (link) BibTeX
- Ralph J. Faudree, Evelyne Flandrin, Zdenek Ryjácek:
Claw-free graphs - A survey.
87-147
Electronic Edition (link) BibTeX
- Izolda Gorgol:
On bounds for size Ramsey numbers of a complete tripartite graph.
149-153
Electronic Edition (link) BibTeX
- Harald Gropp:
Configurations and graphs - II.
155-163
Electronic Edition (link) BibTeX
- Yubao Guo, Axel Pinkernell, Lutz Volkmann:
On cycles through a given vertex in multipartite tournaments.
165-170
Electronic Edition (link) BibTeX
- Mirko Hornák, Stanislav Jendrol:
On the d-distance face chromatic number of plane graphs.
171-174
Electronic Edition (link) BibTeX
- Gyula O. H. Katona:
Extremal problems for finite sets and convex hulls - A survey.
175-185
Electronic Edition (link) BibTeX
- Gyula Y. Katona:
Toughness and edge-toughness.
187-196
Electronic Edition (link) BibTeX
- Marek Kubale, Jaroslaw Pakulski, Konrad Piwakowski:
The smallest hard-to-color graph for the SL algorithm.
197-212
Electronic Edition (link) BibTeX
- Maria Kwasnik, Alina Szelecka:
Strong perfectness of the generalized Cartesian product of graphs.
213-220
Electronic Edition (link) BibTeX
- Zbigniew Lonc:
Delta-system decompositions of graphs.
221-224
Electronic Edition (link) BibTeX
- Zofia Majcher, Jerzy Michael:
Degree sequences of highly irregular graphs.
225-236
Electronic Edition (link) BibTeX
- Zofia Majcher, Jerzy Michael:
Highly irregular graphs with extreme numbers of edges.
237-242
Electronic Edition (link) BibTeX
- Konrad Piwakowski:
On Ramsey number R(4, 3, 3) and triangle-free edge-chromatic graphs in three colors.
243-249
Electronic Edition (link) BibTeX
- Andrzej Rucinski, Miroslaw Truszczynski:
A note on local colorings of graphs.
251-255
Electronic Edition (link) BibTeX
- Zdenek Ryjácek:
Matching extension in K1, r-free graphs with independent claw centers.
257-263
Electronic Edition (link) BibTeX
- Jean-François Saclé, Mariusz Wozniak:
A note on packing of three forests.
265-274
Electronic Edition (link) BibTeX
- Günter Schaar:
On the Hamiltonicity exponent of directed cacti.
275-284
Electronic Edition (link) BibTeX
- Jerzy Topp, Preben D. Vestergaard:
Totally equimatchable graphs.
285-290
Electronic Edition (link) BibTeX
- Hoa Vu Dinh:
Path partition number in tough graphs.
291-294
Electronic Edition (link) BibTeX
- Andrzej Wloch, Iwona Wloch:
On (k, l)-kernels in generalized products.
295-301
Electronic Edition (link) BibTeX
- A. Pawel Wojda, Paul Vaderlind:
Packing bipartite graphs.
303-311
Electronic Edition (link) BibTeX
- Günter Schaar, A. Pawel Wojda:
An upper bound for the Hamiltonicity exponent of finite digraphs.
313-316
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:56:59 2009
by Michael Ley (ley@uni-trier.de)