Sommaire

A survey of hereditary properties of graphs

Mieczysław Borowiecki ; Izak Broere ; Marietjie Frick ; Peter Mihók ; Gabriel Semanišin

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

The Polish Digital Mathematics Library
Maximal graphs with respect to hereditary properties

Izak Broere ; Marietjie Frick ; Gabriel Semanišin

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

The Polish Digital Mathematics Library
On some variations of extremal graph problems

Gabriel Semanišin

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

The Polish Digital Mathematics Library
Graphs maximal with respect to hom-properties

Jan Kratochvíl ; Peter Mihók ; Gabriel Semanišin

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

The Polish Digital Mathematics Library
𝓟-bipartitions of minor hereditary properties

Piotr Borowiecki ; Jaroslav Ivančo

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

The Polish Digital Mathematics Library
Partitions of some planar graphs into two linear forests

Piotr Borowiecki ; Mariusz Hałuszczak

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

The Polish Digital Mathematics Library
Uniquely partitionable graphs

Jozef Bucko ; Marietjie Frick ; Peter Mihók ; Roman Vasky

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

The Polish Digital Mathematics Library
The order of uniquely partitionable graphs

Izak Broere ; Marietjie Frick ; Peter Mihók

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

The Polish Digital Mathematics Library
On generalized list colourings of graphs

Mieczysław Borowiecki ; Izak Broere ; Peter Mihók

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

The Polish Digital Mathematics Library
On a characterization of graphs by average labellings

Matúš Harminc

Access to full text
Full (PDF)
p. 133-136

The Polish Digital Mathematics Library
Generalized colorings and avoidable orientations

Jenő Szigeti ; Zsolt Tuza

Access to full text
Full (PDF)
p. 137-145

The Polish Digital Mathematics Library
Generalized domination, independence and irredudance in graphs

Mieczysław Borowiecki ; Danuta Michalak ; Elżbieta Sidorowicz

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

The Polish Digital Mathematics Library
Graph colorings with local constraints - a survey

Zsolt Tuza

Access to full text
Full (PDF)
p. 161-228

The Polish Digital Mathematics Library
On the cost chromatic number of outerplanar, planar, and line graphs

John Mitchem ; Patrick Morriss ; Edward Schmeichel

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

The Polish Digital Mathematics Library
Localization of jumps of the point-distinguishing chromatic index of Kn,n

Mirko Horňák ; Roman Soták

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

The Polish Digital Mathematics Library
On the computational complexity of (O,P)-partition problems

Jan Kratochvíl ; Ingo Schiermeyer

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

The Polish Digital Mathematics Library
Spanning trees with many or few colors in edge-colored graphs

Hajo Broersma ; Xueliang Li

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

The Polish Digital Mathematics Library
Factor-criticality and matching extension in DCT-graphs

Odile Favaron ; Evelyne Favaron ; Zdenĕk Ryjáček

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

The Polish Digital Mathematics Library
Minimal vertex degree sum of a 3-path in plane maps

O.V. Borodin

Access to full text
Full (PDF)
p. 279-284

The Polish Digital Mathematics Library
Rotation and jump distances between graphs

Gary Chartrand ; Heather Gavlas ; Héctor Hevia ; Mark A. Johnson

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

The Polish Digital Mathematics Library
Isomorphic components of Kronecker product of bipartite graphs

Pranava K. Jha ; Sandi Klavžar ; Blaž Zmazek

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

The Polish Digital Mathematics Library
Partition problems and kernels of graphs

Izak Broere ; Péter Hajnal ; Peter Mihók

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

The Polish Digital Mathematics Library