antimode
turning point
boxicity
yrast trap
Canadian traveller problem
arboricity
Steiner tree
Borůvka's algorithm
decycling
ultrasparsifier
ultramaximal
covering number
altermatic
girth
anarboricity
subdrawing
sparsifier
minimality
minimum spanning tree
pluperfection
semigraphitic
Floyd-Warshall algorithm
reachability
local minimum
graphette
cutwidth
Menger's theorem
sparsify
metanode
domination number
chart
tournament
Johnson's algorithm
graphotactic
closeness
Desargues graph
Herschel graph
bar graph
order
diagram
bar chart
graphotactically
supergraph
biadjacency
clique number
hypsogram
independence number
melonic
maxmin
graphetically
transiso
adjacency list
clique
edge
boundary
cage
peakset
polynema
plane tree
plumbago
bound
sparsification
subminimum
digraph
antiregular
perithreshold
chromatic number
linear programming
directed
crossing number
sofic
miniversal
Chinese postman problem
connectivity
slopegraph
protograph
size
sparkline
dendrimer
assortativity
line
small-world network
ladderize
strongly connected component
graph antihole
Eppstein's algorithm
subdigraph
anticycle
adjacency matrix
hypograph
minimization
directed graph
directed acyclic graph
graphometric
streamgraph
supermaxim
edge set
basal
line graph
polygraph