Geodesic

Volume 28 (2008) no. 1

Sommaire

Competition hypergraphs of digraphs with certain properties I. Strong connectedness
p. 5-21
Competition hypergraphs of digraphs with certain properties II. Hamiltonicity
p. 23-34
Recognizable colorings of graphs
p. 35-57
Trees with equal total domination and total restrained domination numbers
p. 59-66
A classification for maximal nonhamiltonian Burkard-Hammer graphs
p. 67-89
An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles
p. 91-96
Partitions of a graph into cycles containing a specified linear forest
p. 97-107
Weakly connected domination subdivision numbers
p. 109-119
Paths of low weight in planar graphs
p. 121-135
(H,k) stable graphs with minimum size
p. 137-149
Maximal k-independent sets in graphs
p. 151-163
Radio k-labelings for Cartesian products of graphs
p. 165-178
A cancellation property for the direct product of graphs
p. 179-184