Sommaire

Balanced problems on graphs with categorization of edges

Štefan Berežný ; Vladimír Lacko

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

The Polish Digital Mathematics Library
2-placement of (p,q)-trees

Beata Orchel

Access to full text
Full (PDF)
p. 23-36

The Polish Digital Mathematics Library
Decomposition of complete graphs into factors of diameter two and three

Damir Vukicević

Access to full text
Full (PDF)
p. 37-54

The Polish Digital Mathematics Library
Difference labelling of cacti

Martin Sonntag

Access to full text
Full (PDF)
p. 55-65

The Polish Digital Mathematics Library
Vertex-antimagic total labelings of graphs

Martin Bača ; James A. MacDougall ; François Bertault ; Mirka Miller ; Rinovia Simanjuntak ; Slamin

Access to full text
Full (PDF)
p. 67-83

The Polish Digital Mathematics Library
On cyclically embeddable (n,n)-graphs

Agnieszka Görlich ; Monika Pilśniak ; Mariusz Woźniak

Access to full text
Full (PDF)
p. 85-104

The Polish Digital Mathematics Library
On the packing of two copies of a caterpillar in its third power

Christian Germain ; Hamamache Kheddouci

Access to full text
Full (PDF)
p. 105-115

The Polish Digital Mathematics Library
Prime ideals in the lattice of additive induced-hereditary graph properties

Amelie J. Berger ; Peter Mihók

Access to full text
Full (PDF)
p. 117-127

The Polish Digital Mathematics Library
Labeling the vertex amalgamation of graphs

Ramon M. Figueroa-Centeno ; Rikio Ichishima ; Francesc A. Muntaner-Batle

Access to full text
Full (PDF)
p. 129-139

The Polish Digital Mathematics Library
The Ramsey number r(C₇,C₇,C₇)

Ralph Faudree ; Annette Schelten ; Ingo Schiermeyer

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

The Polish Digital Mathematics Library
Perfect connected-dominant graphs

Igor Edmundovich Zverovich

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

The Polish Digital Mathematics Library
Upper bounds for the domination numbers of toroidal queens graphs

Christina M. Mynhardt

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

The Polish Digital Mathematics Library
The size of minimum 3-trees: cases 0 and 1 mod 12

Jorge L. Arocha ; Joaquín Tey

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

The Polish Digital Mathematics Library
On non-z(mod k) dominating sets

Yair Caro ; Michael S. Jacobson

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

The Polish Digital Mathematics Library
Preface

Access to full text
p. 205-206

The Polish Digital Mathematics Library
Hajós' theorem for list colorings of hypergraphs

Claude Benzaken ; Sylvain Gravier ; Riste Skrekovski

Access to full text
Full (PDF)
p. 207-213

The Polish Digital Mathematics Library
Arboreal structure and regular graphs of median-like classes

Bostjan Brešar

Access to full text
Full (PDF)
p. 215-225

The Polish Digital Mathematics Library
Tree-like isometric subgraphs of hypercubes

Bostjan Brešar ; Wilfried Imrich ; Sandi Klavžar

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

The Polish Digital Mathematics Library
Circuit bases of strongly connected digraphs

Petra M. Gleiss ; Josef Leydold ; Peter F. Stadler

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

The Polish Digital Mathematics Library
Improving some bounds for dominating Cartesian products

Bert L. Hartnell ; Douglas F. Rall

Access to full text
Full (PDF)
p. 261-272

The Polish Digital Mathematics Library
Weak k-reconstruction of Cartesian products

Wilfried Imrich ; Blaz Zmazek ; Janez Zerovnik

Access to full text
Full (PDF)
p. 273-285

The Polish Digital Mathematics Library
On constant-weight TSP-tours

Scott Jones ; P. Mark Kayll ; Bojan Mohar ; Walter D. Wallis

Access to full text
Full (PDF)
p. 287-307

The Polish Digital Mathematics Library
Modular and median signpost systems and their underlying graphs

Henry Martyn Mulder ; Ladislav Nebeský

Access to full text
Full (PDF)
p. 309-324

The Polish Digital Mathematics Library
On maximal finite antichains in the homomorphism order of directed graphs

Jaroslav Nesetril ; Claude Tardif

Access to full text
Full (PDF)
p. 325-332

The Polish Digital Mathematics Library
On a special case of Hadwiger's conjecture

Michael D. Plummer ; Michael Stiebitz ; Bjarne Toft

Access to full text
Full (PDF)
p. 333-363

The Polish Digital Mathematics Library
On dually compact closed classes of graphs and BFS-constructible graphs

Norbert Polat

Access to full text
Full (PDF)
p. 365-381

The Polish Digital Mathematics Library
Undirected and directed graphs with near polynomial growth

V.I. Trofimov

Access to full text
Full (PDF)
p. 383-391

The Polish Digital Mathematics Library