default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 164
Volume 164, Numbers 1-3, February 1997
- Anna Rycerz, A. Pawel Wojda, Mariusz Wozniak:
Preface. 1-4 - Jørgen Bang-Jensen
, Gregory Z. Gutin:
Paths and cycles in extended and decomposable digraphs, . 5-19 - Halina Bielak:
Chromatic uniqueness in a family of 2-connected graphs. 21-28 - Haitze J. Broersma:
A note on the minimum size of a vertex pancyclic graph. 29-32 - Stanislaw Bylka, Jan Komar:
Intersection properties of line graphs. 33-45 - Yair Caro, Yehuda Roditty, Johanan Schönheim:
On colored designs - I. 47-65 - Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza:
Efficiency and effectiveness of normal schedules on three dedicated processors. 67-79 - Paul Erdös:
Some recent problems and results in graph theory. 81-85 - Ralph J. Faudree, Evelyne Flandrin, Zdenek Ryjácek:
Claw-free graphs - A survey. 87-147 - Izolda Gorgol:
On bounds for size Ramsey numbers of a complete tripartite graph. 149-153 - Harald Gropp:
Configurations and graphs - II. 155-163 - Yubao Guo, Axel Pinkernell, Lutz Volkmann:
On cycles through a given vertex in multipartite tournaments. 165-170 - Mirko Hornák, Stanislav Jendrol':
On the d-distance face chromatic number of plane graphs. 171-174 - Gyula O. H. Katona:
Extremal problems for finite sets and convex hulls - A survey. 175-185 - Gyula Y. Katona:
Toughness and edge-toughness. 187-196 - Marek Kubale, Jaroslaw Pakulski, Konrad Piwakowski:
The smallest hard-to-color graph for the SL algorithm. 197-212 - Maria Kwasnik, Alina Szelecka:
Strong perfectness of the generalized Cartesian product of graphs. 213-220 - Zbigniew Lonc:
Delta-system decompositions of graphs. 221-224 - Zofia Majcher, Jerzy Michael:
Degree sequences of highly irregular graphs. 225-236 - Zofia Majcher, Jerzy Michael:
Highly irregular graphs with extreme numbers of edges. 237-242 - Konrad Piwakowski:
On Ramsey number R(4, 3, 3) and triangle-free edge-chromatic graphs in three colors. 243-249 - Andrzej Rucinski, Miroslaw Truszczynski:
A note on local colorings of graphs. 251-255 - Zdenek Ryjácek:
Matching extension in K1, r-free graphs with independent claw centers. 257-263 - Jean-François Saclé, Mariusz Wozniak:
A note on packing of three forests. 265-274 - Günter Schaar:
On the Hamiltonicity exponent of directed cacti. 275-284 - Jerzy Topp, Preben D. Vestergaard:
Totally equimatchable graphs. 285-290 - Hoa Vu Dinh:
Path partition number in tough graphs. 291-294 - Andrzej Wloch, Iwona Wloch:
On (k, l)-kernels in generalized products. 295-301 - A. Pawel Wojda, Paul Vaderlind:
Packing bipartite graphs. 303-311 - Günter Schaar, A. Pawel Wojda:
An upper bound for the Hamiltonicity exponent of finite digraphs. 313-316
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-23 19:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
