Geodesic

Volume 27 (2007) no. 3

Sommaire

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