OurBigBook.comSite Source code

Path in a graph

A path of length

t

is a sequence of

t + 1

distinct vertices in which consecutive vertices are adjacent.

Table of contents 51 2
- Long path from minimum degree Path in a graph 18
- Erdos-Gallai path edge bound Path in a graph 15

 Ancestors (5)

 Incoming links (3)