Locally path-like graphs. (English) Zbl 0681.05043

Fronček, Dalibor

Čas. Pěstování Mat. 114, No. 2, 176-180 (1989).

A graph is said to be locally path-like if the neighbourhood of every vertex is a path. The main result: Let G be a locally path-like graph with n vertices and m edges. Then \(m\leq n(n+6)/6\).

Reviewer: St.Znám

MSC:

05C38	Paths and cycles
05C35	Extremal problems in graph theory

Keywords:

neighbourhood of a vertex