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