Canadian traveller problem
Chinese postman problem
closeness
Borůvka's algorithm
algebraic graph theory
reachability
Eppstein's algorithm
antimode
Johnson's algorithm
small-world network
Bellman-Ford algorithm
breadth
Dijkstra's algorithm
A*
girth
pathwidth
grapholectal
circumference
Herschel graph
Floyd-Warshall algorithm
ultrasparsifier
graphotactic
sparsifier
decycling
Suurballe's algorithm
hypernode
graphic
subdrawing
dominate
graphical
graph-theoretically
metanode
directed
Steiner tree
turning point
pluperfection
superconcentrator
cage
Menger's theorem
graph-theoretical
boxicity
graphetically
graph theory
graphette
assortativity
graph antihole
local minimum
arboricity
isthmoid
graphable
clique number
plumbago
cutwidth
line graph
path length
graphlike
tournament
graphitoidal
centrality
crossing number
isthmus
altermatic
sofic
depth-first search
king
biadjacency
graphologic
connected graph
end
Warnock algorithm
chart
pseudo-edge
graphonomy
covering number
cocktail party graph
anarboricity
graph
chartable
postdominate
Kruskal's algorithm
graphemically
polynema
dendrimer
reachable
Robertson-Seymour theorem
graphotactically
collider
interaction matrix
graphon
polygraph
undirected path
pseudodigraph
clique
digraph
diagram