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