default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 19
Volume 19, Number 1, 1999
- Stefan Grünewald, Eckhard Steffen:
Cyclically 5-edge connected non-bicritical critical snarks. 5-11 - Ralph J. Faudree, András Gyárfás:
Extremal problems for forbidden pairs that imply hamiltonicity. 13-29 - Andrzej Wloch:
Distance perfectness of graphs. 31-43 - Gary Chartrand, Ping Zhang:
The forcing geodetic number of a graph. 45-58 - Marián Klesc:
The crossing numbers of products of a 5-vertex graph with paths and cycles. 59-69 - Jozef Bucko, Jaroslav Ivanco:
Uniquely partitionable planar graphs with respect to properties having a forbidden tree. 71-78 - Hanns-Martin Teichert:
The sum number of d-partite complete hypergraphs. 79-91 - Ernest J. Cockayne, Christina M. Mynhardt
:
On 1-dependent ramsey numbers for graphs. 93-110
Volume 19, Number 2, 1999
- Francis K. Bell, Dragos M. Cvetkovic, Peter Rowlinson, Slobodan K. Simic:
Some additions to the theory of star partitions of graphs. 119-134 - Halina Bielak:
A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs. 135-142 - Amelie J. Berger, Izak Broere:
Minimal reducible bounds for hom-properties of graphs. 143-158 - Mieczyslaw Borowiecki, Peter Mihók, Zsolt Tuza, Margit Voigt:
Remarks on the existence of uniquely partitionable planar graphs. 159-166 - Izak Broere, Peter Mihók, Samuel J. T. Moagi, Roman Vasky:
Factorizations of properties of graphs. 167-174 - Erik Bruoth, Mirko Hornák:
On-line ranking number for cycles and paths. 175-197 - Stefan A. Burr, Michael S. Jacobson, Peter Mihók, Gabriel Semanisin:
Generalized Ramsey theory and decomposable properties of graphs. 199-217 - Dalibor Froncek:
Note on cyclic decompositions of complete bipartite graphs into cubes. 219-227 - Mariusz Haluszczak, Pavol Vateha:
On the completeness of decomposable properties of graphs. 229-236 - Matús Harminc, Roman Soták:
A note on kernels and solutions in digraphs. 237-240 - Mariusz Wozniak:
On cyclically embeddable graphs. 241-248
- Matús Harminc:
On strongly connected orientations of graphs. 249-249 - Zdzislaw Skupien:
On distance edge colourings of a cyclic multigraph. 251-252 - Zdzislaw Skupien:
Problems on fully irregular digraphs. 253-255
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-02-21 19:36 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:
