Sommaire

Preface

Access to full text
Full (PDF)
p. 5

The Polish Digital Mathematics Library
On domination in graphs

Frank Göring ; Jochen Harant

Access to full text
Full (PDF)
p. 7-12

The Polish Digital Mathematics Library
Graphs with large double domination numbers

Michael A. Henning

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

The Polish Digital Mathematics Library
On double domination in graphs

Jochen Harant ; Michael A. Henning

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

The Polish Digital Mathematics Library
Total domination in categorical products of graphs

Douglas F. Rall

Access to full text
Full (PDF)
p. 35-44

The Polish Digital Mathematics Library
Planar Ramsey numbers

Izolda Gorgol

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

The Polish Digital Mathematics Library
Domination numbers in graphs with removed edge or set of edges

Magdalena Lemańska

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

The Polish Digital Mathematics Library
Multicolor Ramsey numbers for paths and cycles

Tomasz Dzido

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

The Polish Digital Mathematics Library
Maximal hypergraphs with respect to the bounded cost hereditary property

Ewa Drgas-Burchardt ; Anna Fiedorowicz

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

The Polish Digital Mathematics Library
Note on the split domination number of the Cartesian product of paths

Maciej Zwierzchowski

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

The Polish Digital Mathematics Library
Dominating bipartite subgraphs in graphs

Gábor Bacsó ; Danuta Michalak ; Zsolt Tuza

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

The Polish Digital Mathematics Library
Combinatorial lemmas for polyhedrons

Adam Idzik ; Konstanty Junosza-Szaniawski

Access to full text
Full (PDF)
p. 95-102

The Polish Digital Mathematics Library
On (k,l)-kernel perfectness of special classes of digraphs

Magdalena Kucharska

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

The Polish Digital Mathematics Library
Graph domination in distance two

Gábor Bacsó ; Attila Tálos ; Zsolt Tuza

Access to full text
Full (PDF)
p. 121-128

The Polish Digital Mathematics Library
The cycle-complete graph Ramsey number r(C₅,K₇)

Ingo Schiermeyer

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

The Polish Digital Mathematics Library
Two variants of the size Ramsey number

Andrzej Kurek ; Andrzej Ruciński

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

The Polish Digital Mathematics Library
Distance coloring of the hexagonal lattice

Peter Jacko ; Stanislav Jendrol'

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

The Polish Digital Mathematics Library
Arithmetically maximal independent sets in infinite graphs

Stanisław Bylka

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

The Polish Digital Mathematics Library
Median and quasi-median direct products of graphs

Boštjan Brešar ; Pranava K. Jha ; Sandi Klavžar ; Blaž Zmazek

Access to full text
Full (PDF)
p. 183-196

The Polish Digital Mathematics Library
Some crossing numbers of products of cycles

Marián Klešč

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

The Polish Digital Mathematics Library
Note on partitions of planar graphs

Izak Broere ; Bonita S. Wilson ; Jozef Bucko

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

The Polish Digital Mathematics Library
Estimation of cut-vertices in edge-coloured complete graphs

Adam Idzik

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

The Polish Digital Mathematics Library
Coloring of G²∖G, for Euclidesian graph G

Konstanty Junosza-Szaniawski

Access to full text
Full (PDF)
p. 219

The Polish Digital Mathematics Library
On a conjecture of quintas and arc-traceability in upset tournaments

Arthur H. Busch ; Michael S. Jacobson ; K. Brooks Reid

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

The Polish Digital Mathematics Library
Connected odd dominating sets in graphs

Yair Caro ; William F. Klostermeyer ; Raphael Yuster

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

The Polish Digital Mathematics Library
A tandem version of the cops and robber game played on products of graphs

Nancy E. Clarke ; Richard J. Nowakowski

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

The Polish Digital Mathematics Library
Domination and leaf density in graphs

Anders Sune Pedersen

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

The Polish Digital Mathematics Library
Mycielskians and matchings

Tomislav Doslić

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

The Polish Digital Mathematics Library
On graphs G for which both g and G̅ are claw-free

Shinya Fujita

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

The Polish Digital Mathematics Library
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs

Ralph J. Faudree ; Ronald J. Gould ; Michael S. Jacobson

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

The Polish Digital Mathematics Library
Exact double domination in graphs

Mustapha Chellali ; Abdelkader Khelladi ; Frédéric Maffray

Access to full text
Full (PDF)
p. 291-302

The Polish Digital Mathematics Library
Hamilton decompositions of line graphs of some bipartite graphs

David A. Pike

Access to full text
Full (PDF)
p. 303-310

The Polish Digital Mathematics Library
Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees

Michael Kubesa

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

The Polish Digital Mathematics Library
Decompositions into two paths

Zdzisław Skupień

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

The Polish Digital Mathematics Library
The directed path partition conjecture

Marietjie Frick ; Susan van Aardt ; Gcina Dlamini ; Jean Dunbar ; Ortrud Oellermann

Access to full text
Full (PDF)
p. 331-343

The Polish Digital Mathematics Library
On the p-domination number of cactus graphs

Mostafa Blidia ; Mustapha Chellali ; Lutz Volkmann

Access to full text
Full (PDF)
p. 355-361

The Polish Digital Mathematics Library
On γ-labelings of trees

Gary Chartrand ; David Erwin ; Donald W. VanderJagt ; Ping Zhang

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

The Polish Digital Mathematics Library
A note on maximal common subgraphs of the Dirac's family of graphs

Jozef Bucko ; Peter Mihók ; Jean-François Saclé ; Mariusz Woźniak

Access to full text
Full (PDF)
p. 385-390

The Polish Digital Mathematics Library
An upper bound of the basis number of the strong product of graphs

Mohammed M.M. Jaradat

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

The Polish Digital Mathematics Library
Kernels in monochromatic path digraphs

Hortensia Galeana-Sánchez ; Laura Pastrana Ramírez ; Hugo Alberto Rincón Mejía

Access to full text
Full (PDF)
p. 407-417

The Polish Digital Mathematics Library
On short cycles through prescribed vertices of a polyhedral graph

Erhard Hexel

Access to full text
Full (PDF)
p. 419-426

The Polish Digital Mathematics Library
On a sphere of influence graph in a one-dimensional space

Zbigniew Palka ; Monika Sperling

Access to full text
Full (PDF)
p. 427-433

The Polish Digital Mathematics Library
Highly connected counterexamples to a conjecture on α-domination

Zsolt Tuza

Access to full text
Full (PDF)
p. 435-440

The Polish Digital Mathematics Library