Volume 188, Numbers 1-3, June 1998
Ahmed M. Assaf
: Directed covering with block size 5 and index even.
: Vertex pancyclism in claw-free graphs.
: Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem.
: Edge degree conditions for subpancyclicity in line graphs.
: A lower bound on the independence number of a graph.
: Some t-designs are minimal (t + 1)-coverings.
: The kissing number of the regular polygon.