Geodesic

Tome 27 (2007) no. 1

Sommaire

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