Sommaire

Monochromatic kernel-perfectness of special classes of digraphs
p. 389
The Chvátal-Erdős condition and 2-factors with a specified number of components
p. 401
Efficient (j,k)-domination
p. 409
Some totally 4-choosable multigraphs
p. 425
On (k,l)-kernels in D-join of digraphs
p. 457
Towards a characterization of bipartite switching classes by means of forbidden subgraphs
p. 471
Distance defined by spanning trees in graphs
p. 485
The structure and existence of 2-factors in iterated line graphs
p. 507
Counterexample to a conjecture on the structure of bipartite partitionable graphs
p. 527
Fractional domination in prisms
p. 541
A proof of the crossing number of $K_{3,n}$ in a surface
p. 549
An approximation algorithm for the total covering problem
p. 553
'3in1' enhanced: three squared ways to '3in1' GRAPHS
p. 561
The representation of multi-hypergraphs by set intersections
p. 565
Magic and supermagic dense bipartite graphs
p. 583
Factoring directed graphs with respect to the cardinal product in polynomial time
p. 593
Minimal non-selfcentric radially-maximal graphs of radius 4
p. 603
A Sokoban-type game and arc deletion within irregular digraphs of all sizes
p. 611
Preface to proceedings
p. 559