Sommaire

Cyclically 5-edge connected non-bicritical critical snarks

Stefan Grünewald ; Eckhard Steffen

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

The Polish Digital Mathematics Library
Extremal problems for forbidden pairs that imply hamiltonicity

Ralph Faudree ; András Gyárfás

Access to full text
Full (PDF)
p. 13-29

The Polish Digital Mathematics Library
Distance perfectness of graphs

Andrzej Włoch

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

The Polish Digital Mathematics Library
The forcing geodetic number of a graph

Gary Chartrand ; Ping Zhang

Access to full text
Full (PDF)
p. 45-58

The Polish Digital Mathematics Library
The crossing numbers of products of a 5-vertex graph with paths and cycles

Marián Klešč

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

The Polish Digital Mathematics Library
Uniquely partitionable planar graphs with respect to properties having a forbidden tree

Jozef Bucko ; Jaroslav Ivančo

Access to full text
Full (PDF)
p. 71-78

The Polish Digital Mathematics Library
The sum number of d-partite complete hypergraphs

Hanns-Martin Teichert

Access to full text
Full (PDF)
p. 79-91

The Polish Digital Mathematics Library
On 1-dependent ramsey numbers for graphs

E.J. Cockayne ; C.M. Mynhardt

Access to full text
Full (PDF)
p. 93-110

The Polish Digital Mathematics Library
Some additions to the theory of star partitions of graphs

Francis K. Bell ; Dragos Cvetković ; Peter Rowlinson ; Slobodan K. Simić

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

The Polish Digital Mathematics Library
A note on the Ramsey number and the planar Ramsey number for C₄ and complete graphs

Halina Bielak

Access to full text
Full (PDF)
p. 135-142

The Polish Digital Mathematics Library
Minimal reducible bounds for hom-properties of graphs

Amelie Berger ; Izak Broere

Access to full text
Full (PDF)
p. 143-158

The Polish Digital Mathematics Library
Remarks on the existence of uniquely partitionable planar graphs

Mieczysław Borowiecki ; Peter Mihók ; Zsolt Tuza ; M. Voigt

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

The Polish Digital Mathematics Library
Factorizations of properties of graphs

Izak Broere ; Samuel John Teboho Moagi ; Peter Mihók ; Roman Vasky

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

The Polish Digital Mathematics Library
On-line ranking number for cycles and paths

Erik Bruoth ; Mirko Horňák

Access to full text
Full (PDF)
p. 175-197

The Polish Digital Mathematics Library
Generalized ramsey theory and decomposable properties of graphs

Stefan A. Burr ; Michael S. Jacobson ; Peter Mihók ; Gabriel Semanišin

Access to full text
Full (PDF)
p. 199-217

The Polish Digital Mathematics Library
Note on cyclic decompositions of complete bipartite graphs into cubes

Dalibor Fronček

Access to full text
Full (PDF)
p. 219-227

The Polish Digital Mathematics Library
On the completeness of decomposable properties of graphs

Mariusz Hałuszczak ; Pavol Vateha

Access to full text
Full (PDF)
p. 229-236

The Polish Digital Mathematics Library
A note on kernels and solutions in digraphs

Matúš Harminc ; Roman Soták

Access to full text
Full (PDF)
p. 237-240

The Polish Digital Mathematics Library
On cyclically embeddable graphs

Mariusz Woźniak

Access to full text
Full (PDF)
p. 241-248

The Polish Digital Mathematics Library
On strongly connected orientations of graphs

Matúš Harminc

Access to full text
Full (PDF)
p. 249

The Polish Digital Mathematics Library
On distance edge colourings of a cyclic multigraph

Zdzisław Skupień

Access to full text
Full (PDF)
p. 251-252

The Polish Digital Mathematics Library
Problems on fully irregular digraphs

Zdzisław Skupień

Access to full text
Full (PDF)
p. 253-255

The Polish Digital Mathematics Library