Sommaire

Radio k-colorings of paths
p. 5
Hamilton cycles in split graphs with large minimum degree
p. 23
Characterizations of planar plick graphs
p. 41
Forbidden triples implying Hamiltonicity: for all graphs
p. 47
On traceability and 2-factors in claw-free graphs
p. 55
On the heterochromatic number of circulant digraphs
p. 73
A note on strongly multiplicative graphs
p. 81
Light classes of generalized stars in polyhedral maps on surfaces
p. 85
Some applications of pq-groups in graph theory
p. 109
A note on minimally 3-connected graphs
p. 115
A note on total colorings of planar graphs without 4-cycles
p. 125
A simple linear algorithm for the connected domination problem in circular-arc graphs
p. 137
Generalised irredundance in graphs: Nordhaus-Gaddum bounds
p. 147