Editing List of graph theory topics (section)

==Other topics==
{{columns-list|colwidth=30em|
*[[Adjacency list]]
*[[Adjacency matrix]]
**[[Adjacency algebra]] &ndash; the algebra of polynomials in the adjacency matrix
*[[Canadian traveller problem]]
*[[Clique (graph theory)|Cliques]] and [[Independent set (graph theory)|independent set]]s
**[[Clique problem]]
*[[Connected component (graph theory)|Connected component]]
*[[Cycle space]]
*[[de Bruijn sequences]]
*[[degree diameter|Degree diameter problem]]
*[[Entanglement (graph measure)]]
*[[Erdős–Gyárfás conjecture]]
*[[Eternal dominating set]]
*[[Extremal graph theory]]
**[[Critical graph]]
**[[Turán's theorem]]
*[[Frequency partition]]
*[[Frucht's theorem]]
*[[Girth (graph theory)|Girth]]
*[[Graph drawing]]
*[[Graph homomorphism]]
*[[Graph labeling]]
**[[Graceful labeling]]
*[[Graph partition]]
*[[Graph pebbling]]
*[[Graph property]]
*[[Graph reduction]]
*[[Graph-structured stack]]
*[[Graphical model]]
**[[Bayesian network]]
**[[D-separation]]
**[[Markov random field]]
*[[Tree decomposition]] ([[Junction tree]]) and [[treewidth]]
*[[Graph triangulation]] (see also [[Chordal graph]])
*[[Perfect order]]
*[[Hidden Markov model]]
**[[Baum–Welch algorithm]]
**[[Viterbi algorithm]]
*[[Incidence matrix]]
*[[Independent set problem]]
*[[Knowledge representation]]
**[[Conceptual graph]]
**[[Mind map]]
*[[Level structure]]
*[[Link popularity]]
*[[Mac Lane's planarity criterion]]
*[[Node influence metric]]
*[[Reconstruction conjecture]]
*[[Scientific classification]]
**[[Cladistics]]
**[[Neighbor-joining]]
**[[Phenetics]]
*[[Turán number]]
*[[Shannon switching game]]
*[[Spectral graph theory]]
*[[Spring-based algorithm]]
*[[Strongly connected component]]
*[[Vertex cover problem]]
}}