Sommaire du Fascicule no. 1

Value sets of graphs edge-weighted with elements of a finite abelian group
p. 5
The periphery graph of a median graph
p. 17
Fractional global domination in graphs
p. 33
γ-labelings of complete bipartite graphs
p. 45
The edge geodetic number and Cartesian product of graphs
p. 55
Further results on radial graphs
p. 75
The signless Laplacian spectral radius of graphs with given number of cut vertices
p. 85
Vertex-distinguishing edge-colorings of linear forests
p. 95
On characterization of uniquely 3-list colorable complete multipartite graphs
p. 105
A note on cyclic chromatic number
p. 115
Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4
p. 123
On multiset colorings of graphs
p. 137
On edge detour graphs
p. 155
A conjecture on the prevalence of cubic bridge graphs
p. 175

Sommaire du Fascicule no. 2

On the (2,2)-domination number of trees
p. 185
Radio number for some thorn graphs
p. 201
On locating-domination in graphs
p. 223
On choosability of complete multipartite graphs $K_{4,3*t,2*(k-2t-2),1*(t+1)}$
p. 237
Chvátal-Erdös type theorems
p. 245
Graph centers used for stabilization of matrix factorizations
p. 249
Nordhaus-Gaddum results for weakly convex domination number of a graph
p. 257
k-independence stable graphs upon edge removal
p. 265
17th workshop '3in1' 2008
p. 275
Random procedures for dominating sets in bipartite graphs
p. 277
On a family of cubic graphs containing the flower snarks
p. 289
Mácajová and Škoviera conjecture on cubic graphs
p. 315
Decompositions of multigraphs into parts with the same size
p. 335

Sommaire du Fascicule no. 3

The edge C₄ graph of some graph classes
p. 365
Total outer-connected domination in trees
p. 377
Fall coloring of graphs I
p. 385
3-consecutive c-colorings of graphs
p. 393
Structure of the set of all minimal total dominating functions of some classes of graphs
p. 407
A characterization of (γₜ,γ₂)-trees
p. 425
Graphs for n-circular matroids
p. 437
The competition numbers of Johnson graphs
p. 449
Factoring directed graphs with respect to the cardinal product in polynomial time II
p. 461
Lower bounds for the domination number
p. 475
The Wiener number of powers of the Mycielskian
p. 489
Colouring game and generalized colouring game on graphs with cut-vertices
p. 499

Sommaire du Fascicule no. 4

Arithmetic labelings and geometric labelings of countable graphs
p. 539
Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs
p. 545
Rainbow numbers for small stars with one edge added
p. 555
Partitioning a graph into a dominating set, a total dominating set, and something else
p. 563
Cancellation of direct products of digraphs
p. 575
On the existence of a cycle of length at least 7 in a (1,≤ 2)-twin-free graph
p. 591
Matchings and total domination subdivision number in graphs with few induced 4-cycles
p. 611
Vertex coloring the square of outerplanar graphs of low degree
p. 619
On Ramsey $(K_{1,2},C₄)$-minimal graphs
p. 637
Clique graph representations of ptolemaic graphs
p. 651
On vertex stability with regard to complete bipartite subgraphs
p. 663
n-ary transit functions in graphs
p. 671
The geodetic number of strong product graphs
p. 687
A note on Hamiltonian cycles in generalized Halin graphs
p. 701
The NP-completeness of automorphic colorings
p. 705