strongly connected component
Steiner tree
directed
polynema
flow network
tournament
polygraph
digraph
subgraph
Menger's theorem
clique number
edge
cocktail party graph
metanode
connected graph
Kosaraju's algorithm
Coxeter-Dynkin diagram
supergraph
directed graph
directed edge
clique
Borůvka's algorithm
chart
breadth
graphable
graphotactically
complete graph
comdag
assortativity
disassortative
slopegraph
graph-theoretically
indegree
bichromatic
connectivity
multidigraph
anarboricity
directed path
isthmus
graph toughness
cut
viewgraph
Johnson's algorithm
knowledge graph
path length
Desargues graph
graphical
dendrimer
call graph
biconnected
graphic
hyperedge
Bethe lattice
outdegree
graph theory
spider graph
hypergraph
melonic
graph
king
Robertson-Seymour theorem
de Bruijn graph
graphotactic
biclique
utility graph
strongly connected
plumbago
size
cherry graph
line graph
medial graph
cubic graph
undirected path
dual graph
turning point
valency
graph antihole
pseudo-edge
independence number
graphometric
cograph
algebraic graph theory
graphetically
curve
pseudograph
bidirected
boxicity
edge list
hypernode
graphologic
reachability
dismantlable
ultramaximal
cutwidth
end
hypervertex