Articles
389-400
Monochromatic kernel-perfectness of special classes of digraphs
401-407
The Chvátal-Erdős condition and 2-factors with a specified number of components
409-423
Efficient (j,k)-domination
425-455
Some totally 4-choosable multigraphs
457-470
On (k,l)-kernels in D-join of digraphs
471-483
Towards a characterization of bipartite switching classes by means of forbidden subgraphs
485-506
Distance defined by spanning trees in graphs
507-526
The structure and existence of 2-factors in iterated line graphs
527-540
Counterexample to a conjecture on the structure of bipartite partitionable graphs
541-547
Fractional domination in prisms
549-551
A proof of the crossing number of in a surface
553-558
An approximation algorithm for the total covering problem
559
Preface to proceedings
561-563
'3in1' enhanced: three squared ways to '3in1' GRAPHS
565-582
The representation of multi-hypergraphs by set intersections
583-591
Magic and supermagic dense bipartite graphs
593-601
Factoring directed graphs with respect to the cardinal product in polynomial time
603-610
Minimal non-selfcentric radially-maximal graphs of radius 4
611-622