breadth
closeness
Johnson's algorithm
superconcentrator
king
Suurballe's algorithm
clique number
path length
Menger's theorem
circumference
Chinese postman problem
Hamiltonian path
Coxeter graph
connected graph
strongly connected
Eppstein's algorithm
edge
pseudograph
Canadian traveller problem
Desargues graph
laceable
cutwidth
supervertex
intervertex
undirected path
Euler line
reachability
directed path
complete graph
independence number
bidirected
outbranch
girth
pseudo-edge
graph theory
cut
strongly connected component
order
connectivity
dual graph
snake-in-the-box problem
biconnected
cherry graph
diagonal
adjacency matrix
bipartization
tie
flow network
biclique
connected