EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
05-XX Combinatorics
05Cxx Graph theory
05C07 Vertex degrees

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 2 of 2

Mark sequences in digraphs.

Pirzada, S., Samee, U. (2005)

Séminaire Lotharingien de Combinatoire [electronic only]

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.

Currently displaying 1 – 2 of 2

Page 1