Sommaire

The crossing numbers of certain Cartesian products

Marián Klešč

Access to full text
Full (PDF)
p. 5-10

The Polish Digital Mathematics Library
Reducible properties of graphs

P. Mihók ; G. Semanišin

Access to full text
Full (PDF)
p. 11-18

The Polish Digital Mathematics Library
On chromaticity of graphs

Ewa Łazuka

Access to full text
Full (PDF)
p. 19-31

The Polish Digital Mathematics Library
Problems remaining NP-complete for sparse or dense graphs

Ingo Schiermeyer

Access to full text
Full (PDF)
p. 33-41

The Polish Digital Mathematics Library
A note on careful packing of a graph

M. Woźniak

Access to full text
Full (PDF)
p. 43-50

The Polish Digital Mathematics Library
The edge domination problem

Shiow-Fen Hwang ; Gerard J. Chang

Access to full text
Full (PDF)
p. 51-57

The Polish Digital Mathematics Library
Edge-disjoint paths in permutation graphs

C. P. Gopalakrishnan ; C. Pandu Rangan

Access to full text
Full (PDF)
p. 59-72

The Polish Digital Mathematics Library
Distinguishing graphs by the number of homomorphisms

Steve Fisk

Access to full text
Full (PDF)
p. 73-75

The Polish Digital Mathematics Library
Hamiltonicity in multitriangular graphs

Peter J. Owens ; Hansjoachim Walther

Access to full text
Full (PDF)
p. 77-88

The Polish Digital Mathematics Library
Some maximum multigraphs and edge/vertex distance colourings

Zdzisław Skupień

Access to full text
Full (PDF)
p. 89-106

The Polish Digital Mathematics Library
Spanning caterpillars with bounded diameter

Ralph Faudree ; Ronald Gould ; Michael Jacobson ; Linda Lesniak

Access to full text
Full (PDF)
p. 111-118

The Polish Digital Mathematics Library
Efficient algorithms for minimal disjoint path problems on chordal graphs

C.P. Gopalakrishnan ; C.R. Satyan ; C. Pandu Rangan

Access to full text
Full (PDF)
p. 119-145

The Polish Digital Mathematics Library
A linear algorithm for the two paths problem on permutation graphs

C.P. Gopalakrishnan ; C. Pandu Rangan

Access to full text
Full (PDF)
p. 147-166

The Polish Digital Mathematics Library
Stronger bounds for generalized degrees and Menger path systems

R.J. Faudree ; Zs. Tuza

Access to full text
Full (PDF)
p. 167-177

The Polish Digital Mathematics Library
The flower conjecture in special classes of graphs

Zdeněk Ryjáček ; Ingo Schiermeyer

Access to full text
Full (PDF)
p. 179-184

The Polish Digital Mathematics Library
Generalized list colourings of graphs

Mieczysław Borowiecki ; Ewa Drgas-Burchardt ; Peter Mihók

Access to full text
Full (PDF)
p. 185-193

The Polish Digital Mathematics Library
On the factorization of reducible properties of graphs into irreducible factors

P. Mihók ; R. Vasky

Access to full text
Full (PDF)
p. 195-203

The Polish Digital Mathematics Library
Vizing's conjecture and the one-half argument

Bert Hartnell ; Douglas F. Rall

Access to full text
Full (PDF)
p. 205-216

The Polish Digital Mathematics Library