default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 15
Volume 15, Number 1, 1995
- Marián Klesc:
The crossing numbers of certain Cartesian products. 5-10 - Peter Mihók, Gabriel Semanisin
:
Reducible properties of graphs. 11-18 - Ewa Lazuka:
On chromaticity of graphs. 19-31 - Ingo Schiermeyer:
Problems remaining NP-complette for sparse or dense graphs. 33-41 - Mariusz Wozniak:
A note on careful packing of a graph. 43-50 - Gerard J. Chang, Shiow-Fen Hwang:
The edge domination problem. 51-57 - C. P. Gopalakrishnan, C. Pandu Rangan:
Edge-disjoint paths in permutation graphs. 59-72 - Steve Fisk:
Distinguishing graphs by the number of homomorphisms. 73-75 - Peter J. Owens, Hansjoachim Walther:
Hamiltonicity in multitriangular graphs. 77-88 - Zdzislaw Skupien:
Some maximum multigraphs and adge/vertex distance colourings. 89-106
Volume 15, Number 2, 1995
- Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Spanning caterpllars with bounded diameter. 111-118 - C. P. Gopalakrishnan, C. Pandu Rangan, Satyan R. Coorg:
Efficient algorithms for minimal disjoint path problems on chordal graphs. 119-145 - C. P. Gopalakrishnan, C. Pandu Rangan:
A linear algorithms for the two paths problem on permutation graphs. 147-166 - Ralph J. Faudree, Zsolt Tuza:
Stronger bounds for generalized degress and Menger path systems. 167-177 - Zdenek Ryjácek, Ingo Schiermeyer:
The flower conjecture in special classes of graphs. 179-184 - Mieczyslaw Borowiecki, Ewa Drgas-Burchardt, Peter Mihók:
Generalized list colourings of graphs. 185-193 - Peter Mihók, Roman Vasky:
On the factorization of reducible properties of graphs into irreducible factors. 195-203 - Bert L. Hartnell, Douglas F. Rall:
Vizing's conjecture and the one-half argument. 205-216
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 2024-12-19 22:14 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:
