Sommaire

Colouring of cycles in the de Bruijn graphs

Ewa Łazuka ; Jerzy Żurawiecki

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

The Polish Digital Mathematics Library
The strong isometric dimension of finite reflexive graphs

Shannon L. Fitzpatrick ; Richard J. Nowakowski

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

The Polish Digital Mathematics Library
Recognizing weighted directed cartesian graph bundles

Blaz Zmazek ; Janez Zerovnik

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

The Polish Digital Mathematics Library
Mean value for the matching and dominating polynomial

Jorge Luis Arocha ; Bernardo Llano

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

The Polish Digital Mathematics Library
Some news about the independence number of a graph

Jochen Harant

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

The Polish Digital Mathematics Library
About uniquely colorable mixed hypertrees

Angela Niculitsa ; Vitaly Voloshin

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

The Polish Digital Mathematics Library
Classes of hypergraphs with sum number one

Hanns-Martin Teichert

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

The Polish Digital Mathematics Library
Long induced paths in 3-connected planar graphs

Jorge Luis Arocha ; Pilar Valencia

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

The Polish Digital Mathematics Library
A class of tight circulant tournaments

Hortensia Galeana-Sánchez ; Víctor Neumann-Lara

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

The Polish Digital Mathematics Library
Geodetic sets in graphs

Gary Chartrand ; Frank Harary ; Ping Zhang

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

The Polish Digital Mathematics Library
Some results concerning the ends of minimal cuts of simple graphs

Xiaofeng Jia

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

The Polish Digital Mathematics Library
Unique factorization theorem

Peter Mihók

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

The Polish Digital Mathematics Library
Some conjectures on perfect graphs

Van Bang Le

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

The Polish Digital Mathematics Library
2-factors in claw-free graphs

Guantao Chen ; Jill R. Faudree ; Ronald J. Gould ; Akira Saito

Access to full text
Full (PDF)
p. 165-172

The Polish Digital Mathematics Library
Note on the weight of paths in plane triangulations of minimum degree 4 and 5

Tomás Madaras

Access to full text
Full (PDF)
p. 173-180

The Polish Digital Mathematics Library
Connectivity of path graphs

Martin Knor ; L'udovít Niepel

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

The Polish Digital Mathematics Library
Dichromatic number, circulant tournaments and Zykov sums of digraphs

Víctor Neumann-Lara

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

The Polish Digital Mathematics Library
On the rank of random subsets of finite affine geometry

Wojciech Kordecki

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

The Polish Digital Mathematics Library
Survey of certain valuations of graphs

Martin Bača ; J.A. MacDougall ; Mirka Miller ; Slamin ; W.D. Wallis

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

The Polish Digital Mathematics Library
Persistency in the Traveling Salesman Problem on Halin graphs

Vladimír Lacko

Access to full text
Full (PDF)
p. 231-242

The Polish Digital Mathematics Library
Kernels in the closure of coloured digraphs

Hortensia Galeana-Sánchez ; José de Jesús García-Ruvalcaba

Access to full text
Full (PDF)
p. 243-254

The Polish Digital Mathematics Library
Sum labellings of cycle hypergraphs

Hanns-Martin Teichert

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

The Polish Digital Mathematics Library
A note on periodicity of the 2-distance operator

Bohdan Zelinka

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

The Polish Digital Mathematics Library
Domination and independence subdivision numbers of graphs

Teresa W. Haynes ; Sandra M. Hedetniemi ; Stephen T. Hedetniemi

Access to full text
Full (PDF)
p. 271-280

The Polish Digital Mathematics Library
The decomposability of additive hereditary properties of graphs

Izak Broere ; Michael J. Dorfling

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

The Polish Digital Mathematics Library
Chromatic polynomials of hypergraphs

Mieczysław Borowiecki ; Ewa Łazuka

Access to full text
Full (PDF)
p. 293-301

The Polish Digital Mathematics Library