Geodesic

Sommaire du Fascicule no. 1

Grundy number of graphs
p. 5-18
Global alliances and independence in trees
p. 19-27
New sufficient conditions for hamiltonian and pancyclic graphs
p. 29-38
A note on uniquely H-colourable graphs
p. 39-44
A note on packing of two copies of a hypergraph
p. 45-49
Digraphs with isomorphic underlying and domination graphs: connected $UG^c(d)$
p. 51-67
Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two
p. 69-82
Trees with equal restrained domination and total restrained domination numbers
p. 83-91
Characterization of block graphs with equal 2-domination number and domination number plus one
p. 93-103
Linear and cyclic radio k-labelings of trees
p. 105-123
Orientation distance graphs revisited
p. 125-136
A new upper bound for the chromatic number of a graph
p. 137-142
Spectral study of alliances in graphs
p. 143-157
Improved upper bounds for nearly antipodal chromatic number of paths
p. 159-174
Total domination of Cartesian products of graphs
p. 175-178
Cycles through specified vertices in triangle-free graphs
p. 179-191
More on even [a,b]-factors in graphs
p. 193-204

Sommaire du Fascicule no. 2

On distance local connectivity and vertex distance colouring
p. 209-227
Variations on a sufficient condition for Hamiltonian graphs
p. 229-240
Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails
p. 241-249
Further results on sequentially additive graphs
p. 251-268
Erdős regular graphs of even degree
p. 269-279
Subgraph densities in hypergraphs
p. 281-297
Infinite families of tight regular tournaments
p. 299-311
On θ-graphs of partial cubes
p. 313-321
Vertex-dominating cycles in 2-connected bipartite graphs
p. 323-332
Edge-connectivity of strong products of graphs
p. 333-343
Histories in path graphs
p. 345-357
(k,l)-kernels, (k,l)-semikernels, k-Grundy functions and duality for state splittings
p. 359-371
On the second largest eigenvalue of a mixed graph
p. 373-384

Sommaire du Fascicule no. 3

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