Geodesic

Sommaire du Fascicule no. 1

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

Sommaire du Fascicule no. 2

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

Sommaire du Fascicule no. 3

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

Sommaire du Fascicule no. 4

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