2008/28/1

Competition hypergraphs of digraphs with certain properties I. Strong connectedness

Competition hypergraphs of digraphs with certain properties II. Hamiltonicity

Recognizable colorings of graphs

Trees with equal total domination and total restrained domination numbers

A classification for maximal nonhamiltonian Burkard-Hammer graphs

An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles

Partitions of a graph into cycles containing a specified linear forest

Weakly connected domination subdivision numbers

Paths of low weight in planar graphs

(H,k) stable graphs with minimum size

Maximal k-independent sets in graphs

Radio k-labelings for Cartesian products of graphs

A cancellation property for the direct product of graphs