EUDML

Currently displaying 1 – 4 of 4

Order by Relevance | Title | Year of publication

2-3 graphs which have Vizing's adjacency property.

P.A. Winter; Henda C. Swart — 1986

Aequationes mathematicae

On the graphs with maximum distance or $k$ -diameter

Wayne Goddard; Christine S. Swart; Henda C. Swart — 2005

Mathematica Slovaca

Minimal claw-free graphs

P. Dankelmann; Henda C. Swart; P. van den Berg; Wayne Goddard; M. D. Plummer — 2008

Czechoslovak Mathematical Journal

A graph $G$ is a minimal claw-free graph (m.c.f. graph) if it contains no $K_{1, 3}$ (claw) as an induced subgraph and if, for each edge $e$ of $G$ , $G - e$ contains an induced claw. We investigate properties of m.c.f. graphs, establish sharp bounds on their orders and the degrees of their vertices, and characterize graphs which have m.c.f. line graphs.