Sommaire

Long cycles and neighborhood union in 1-tough graphs with large degree sums

Vu Dinh Hoa

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

The Polish Digital Mathematics Library
A note on uniquely embeddable graphs

Mariusz Woźniak

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

The Polish Digital Mathematics Library
The leafage of a chordal graph

In-Jen Lin ; Terry A. McKee ; Douglas B. West

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

The Polish Digital Mathematics Library
Degree sequences of digraphs with highly irregular property

Zofia Majcher ; Jerzy Michael

Access to full text
Full (PDF)
p. 49-61

The Polish Digital Mathematics Library
Paired-domination

S. Fitzpatrick ; B. Hartnell

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

The Polish Digital Mathematics Library
Equivalent classes for K₃-gluings of wheels

Halina Bielak

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

The Polish Digital Mathematics Library
New classes of critical kernel-imperfect digraphs

Hortensia Galeana-Sánchez ; V. Neumann-Lara

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

The Polish Digital Mathematics Library
Kernels in edge coloured line digraph

H. Galeana-Sánchez ; L. Pastrana Ramírez

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

The Polish Digital Mathematics Library
The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six

Halina Bielak

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

The Polish Digital Mathematics Library
A path(ological) partition problem

Izak Broere ; Michael Dorfling ; Jean E. Dunbar ; Marietjie Frick

Access to full text
Full (PDF)
p. 113-125

The Polish Digital Mathematics Library
An inequality chain of domination parameters for trees

E.J. Cockayne ; O. Favaron ; J. Puech ; C.M. Mynhardt

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

The Polish Digital Mathematics Library
On generating snarks

Busiso P. Chisala

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

The Polish Digital Mathematics Library
Short cycles of low weight in normal plane maps with minimum degree 5

Oleg V. Borodin ; Douglas R. Woodall

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

The Polish Digital Mathematics Library
On the simplex graph operator

Bohdan Zelinka

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

The Polish Digital Mathematics Library
On independent sets and non-augmentable paths in directed graphs

H. Galeana-Sánchez

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

The Polish Digital Mathematics Library
On hereditary properties of composition graphs

Vadim E. Levit ; Eugen Mandrescu

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

The Polish Digital Mathematics Library
A sufficient condition for the existence of k-kernels in digraphs

H. Galeana-Sánchez ; H.A. Rincón-Mejía

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

The Polish Digital Mathematics Library
Graphs maximal with respect to absence of hamiltonian paths

Bohdan Zelinka

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

The Polish Digital Mathematics Library
On varieties of graphs

Alfonz Haviar ; Roman Nedela

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

The Polish Digital Mathematics Library
Decomposition of multigraphs

Mekkia Kouider ; Maryvonne Mahéo ; Krzysztof Bryś ; Zbigniew Lonc

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

The Polish Digital Mathematics Library
2-halvable complete 4-partite graphs

Dalibor Fronček

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

The Polish Digital Mathematics Library
A conjecture on cycle-pancyclism in tournaments

Hortensia Galeana-Sánchez ; Sergio Rajsbaum

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

The Polish Digital Mathematics Library