Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
List of graph theory topics
open-in-new
<h2 id="examples-and-types-of-graphs">Examples and types of graphs</h2> <ul><li><a href="/facts/Graph_amalgamation/so74p15H"> Amalgamation</a></li> <li><a href="/facts/Bipartite_graph/xWcXV9MB">Bipartite graph</a> <ul><li><a href="/facts/Complete_bipartite_graph/C1RYIdpX">Complete bipartite graph</a></li> <li><a href="/facts/Disperser/jdDrBtCp">Disperser</a></li> <li><a href="/facts/Expander_graph/21stncb0">Expander</a></li> <li><a href="/facts/Extractor_(mathematics)/UC1j6bn9">Extractor</a></li></ul></li> <li><a href="/facts/Bivariegated_graph/6pznWCuW">Bivariegated graph</a></li> <li><a href="/facts/Cage_(graph_theory)/Ya4RhwvU">Cage (graph theory)</a></li> <li><a href="/facts/Cayley_graph/QxoxNnys">Cayley graph</a></li> <li><a href="/facts/Circle_graph/mI27LMXp">Circle graph</a></li> <li><a href="/facts/Clique_graph/YqkbkgvX">Clique graph</a></li> <li><a href="/facts/Cograph/c3lYz8fV">Cograph</a></li> <li><a href="/facts/Common_graph/Wx74rrGk">Common graph</a></li> <li><a href="/facts/Complement_graph/IdHUPFr3">Complement of a graph</a></li> <li><a href="/facts/Complete_graph/AYD6hUqI">Complete graph</a></li> <li><a href="/facts/Cubic_graph/6M32WUIJ">Cubic graph</a></li> <li><a href="/facts/Cycle_graph/bYhnPDHc">Cycle graph</a></li> <li><a href="/facts/De_Bruijn_graph/QKFsDeEw">De Bruijn graph</a></li> <li><a href="/facts/Dense_graph/xFC7b7s9">Dense graph</a></li> <li><a href="/facts/Dipole_graph/9ceBgwJY">Dipole graph</a></li> <li><a href="/facts/Directed_acyclic_graph/k6zq1os9">Directed acyclic graph</a></li> <li><a href="/facts/Directed_graph/YBdfQ0um">Directed graph</a></li> <li><a href="/facts/Distance_regular_graph/pGAuLWYL">Distance regular graph</a></li> <li><a href="/facts/Distance-transitive_graph/HgH4heaB">Distance-transitive graph</a></li> <li><a href="/facts/Edge-transitive_graph/fnK9oyEJ">Edge-transitive graph</a></li> <li><a href="/facts/Interval_graph/oLwYI3uT">Interval graph</a></li> <li><a href="/facts/Indifference_graph/56tB4Vah">Interval graph, improper</a></li> <li><a href="/facts/Interval_graph/oLwYI3uT">Interval graph, proper</a></li> <li><a href="/facts/Line_graph/RWNxSy5j">Line graph</a></li> <li><a href="/facts/Lollipop_graph/wUadAPr3">Lollipop graph</a></li> <li><a href="/facts/Minor_(graph_theory)/qn5eI22T">Minor</a> <ul><li><a href="/facts/Robertson%25E2%2580%2593Seymour_theorem/J7g4CJ74">Robertson–Seymour theorem</a></li></ul></li> <li><a href="/facts/Petersen_graph/lLRxXpQs">Petersen graph</a></li> <li><a href="/facts/Planar_graph/plREagr9">Planar graph</a> <ul><li><a href="/facts/Dual_polyhedron/rkIHbmAf">Dual polyhedron</a></li> <li><a href="/facts/Outerplanar_graph/FrAgUpcV">Outerplanar graph</a></li></ul></li> <li><a href="/facts/Random_graph/gfQhq1Sz">Random graph</a></li> <li><a href="/facts/Regular_graph/j9dSoLE6">Regular graph</a></li> <li><a href="/facts/Scale-free_network/2ENlcjX3">Scale-free network</a></li> <li><a href="/facts/Snark_(graph_theory)/vEG1SrJ4">Snark (graph theory)</a></li> <li><a href="/facts/Sparse_graph/xFC7b7s9">Sparse graph</a> <ul><li><a href="/facts/Sparse_graph_code/UC70jDQX">Sparse graph code</a></li></ul></li> <li><a href="/facts/Split_graph/xsUF1TFT">Split graph</a></li> <li><a href="/facts/String_graph/EQI2vzeh">String graph</a></li> <li><a href="/facts/Strongly_regular_graph/0GbdLwSd">Strongly regular graph</a></li> <li><a href="/facts/Threshold_graph/qMhSrdUd">Threshold graph</a></li> <li><a href="/facts/Total_graph/CwxcyopP">Total graph</a></li> <li><a href="/facts/Tree_(graph_theory)/TCWk4Joy">Tree (graph theory)</a>. <p class="note">See also: § Trees</p></li> <li><a href="/facts/Trellis_(graph)/YtzjHCKa">Trellis (graph)</a></li> <li><a href="/facts/Tur%25C3%25A1n_graph/y0hzJqQQ">Turán graph</a></li> <li><a href="/facts/Ultrahomogeneous_graph/BMXFLwj1">Ultrahomogeneous graph</a></li> <li><a href="/facts/Vertex-transitive_graph/042b7rD7">Vertex-transitive graph</a></li> <li><a href="/facts/Visibility_graph/kEaHTj2A">Visibility graph</a> <ul><li><a href="/facts/Museum_guard_problem/Ytg00bIU">Museum guard problem</a></li></ul></li> <li><a href="/facts/Wheel_graph/rrQQSxNw">Wheel graph</a></li></ul> <h2 id="graph-coloring">Graph coloring</h2> <p class="note">Main article: <a href="/facts/Graph_coloring/J6HoBfP0">Graph coloring</a></p> <ul><li><a href="/facts/Acyclic_coloring/TcE3KwuC">Acyclic coloring</a></li> <li><a href="/facts/Chromatic_polynomial/dvr4Hyz9">Chromatic polynomial</a></li> <li><a href="/facts/Cocoloring/yKkAtlHX">Cocoloring</a></li> <li><a href="/facts/Complete_coloring/7BU2RkpN">Complete coloring</a></li> <li><a href="/facts/Edge_coloring/AcdpUxCv">Edge coloring</a></li> <li><a href="/facts/Exact_coloring/7u8K0cLB">Exact coloring</a></li> <li><a href="/facts/Four_color_theorem/HTS4Nway">Four color theorem</a></li> <li><a href="/facts/Fractional_coloring/xUrC5P71">Fractional coloring</a></li> <li><a href="/facts/Goldberg%25E2%2580%2593Seymour_conjecture/xcCgy0V9">Goldberg–Seymour conjecture</a></li> <li><a href="/facts/Graph_coloring_game/m7oue8TC">Graph coloring game</a></li> <li><a href="/facts/Graph_two-coloring/J6HoBfP0">Graph two-coloring</a></li> <li><a href="/facts/Harmonious_coloring/0qVDN7Vq">Harmonious coloring</a></li> <li><a href="/facts/Incidence_coloring/ndUYMtpj">Incidence coloring</a></li> <li><a href="/facts/List_coloring/fXV2lcSh">List coloring</a></li> <li><a href="/facts/List_edge-coloring/FKQKVMUA">List edge-coloring</a></li> <li><a href="/facts/Perfect_graph/wcPdhjG9">Perfect graph</a></li> <li><a href="/facts/Ramsey%2527s_theorem/VS6K8jGk">Ramsey's theorem</a></li> <li><a href="/facts/Sperner%2527s_lemma/kLbeQFyY">Sperner's lemma</a></li> <li><a href="/facts/Strong_coloring/RUkhd61w">Strong coloring</a></li> <li><a href="/facts/Subcoloring/zayWRe0v">Subcoloring</a></li> <li><a href="/facts/Tait%2527s_conjecture/4FKJrNlL">Tait's conjecture</a></li> <li><a href="/facts/Total_coloring/CwxcyopP">Total coloring</a></li> <li><a href="/facts/Uniquely_colorable_graph/Q2CmHC3e">Uniquely colorable graph</a></li></ul> <h2 id="paths-and-cycles">Paths and cycles</h2> <ul><li><a href="/facts/Path_(graph_theory)/WMsq21Nf">Path (graph theory)</a></li> <li><a href="/facts/Seven_Bridges_of_K%25C3%25B6nigsberg/r95CwL9f">Seven Bridges of Königsberg</a> <ul><li><a href="/facts/Eulerian_path/4l2G67c7">Eulerian path</a></li></ul></li> <li><a href="/facts/Three-cottage_problem/CQQqp6fA">Three-cottage problem</a></li> <li><a href="/facts/Shortest_path_problem/g4nsrswr">Shortest path problem</a> <ul><li><a href="/facts/Dijkstra%2527s_algorithm/ehun88jl">Dijkstra's algorithm</a> <ul><li><a href="/facts/Open_Shortest_Path_First/PACpGUHb">Open Shortest Path First</a></li></ul></li></ul></li> <li><a href="/facts/Flooding_algorithm/tAo7qsDM">Flooding algorithm</a></li> <li><a href="/facts/Route_inspection_problem/zh0EhCsU">Route inspection problem</a></li> <li><a href="/facts/Hamiltonian_path/MHjY2xoY">Hamiltonian path</a> <ul><li><a href="/facts/Hamiltonian_path_problem/heMgdfpa">Hamiltonian path problem</a></li> <li><a href="/facts/Knight%2527s_tour/VuzxY4pt">Knight's tour</a></li></ul></li> <li><a href="/facts/Traveling_salesman_problem/2WEKVLnV">Traveling salesman problem</a> <ul><li><a href="/facts/Nearest_neighbour_algorithm/EjKh21yG">Nearest neighbour algorithm</a></li> <li><a href="/facts/Bottleneck_traveling_salesman_problem/4TJrYK5T">Bottleneck traveling salesman problem</a></li></ul></li> <li>Path analysis (paths and cycles)</li></ul> <h2 id="trees">Trees</h2> <p class="note">Main article: <a href="/facts/Tree_(graph_theory)/TCWk4Joy">Tree (graph theory)</a></p> <ul><li><a href="/facts/Abstract_syntax_tree/73AUK1jI">Abstract syntax tree</a></li> <li><a href="/facts/B-tree/IHE2l8GR">B-tree</a></li> <li><a href="/facts/Binary_tree/TDV7GMpu">Binary tree</a> <ul><li><a href="/facts/Binary_search_tree/gWubNt7b">Binary search tree</a> <ul><li><a href="/facts/Self-balancing_binary_search_tree/W7WAsES0">Self-balancing binary search tree</a> <ul><li><a href="/facts/AVL_tree/DfexIbS6">AVL tree</a></li> <li><a href="/facts/Red%25E2%2580%2593black_tree/ckgWTV7G">Red–black tree</a></li> <li><a href="/facts/Splay_tree/DHKCdoST">Splay tree</a></li> <li><a href="/facts/T-tree/WprNkoa2">T-tree</a></li></ul></li></ul></li> <li><a href="/facts/Binary_space_partitioning/sn9MhTSB">Binary space partitioning</a></li> <li><a href="/facts/Full_binary_tree/TDV7GMpu">Full binary tree</a></li></ul></li> <li><a href="/facts/B*-tree/IHE2l8GR">B*-tree</a></li> <li><a href="/facts/Heap_(data_structure)/A67B0K7L">Heap</a> <ul><li><a href="/facts/Binary_heap/YPJAEN94">Binary heap</a></li> <li><a href="/facts/Binomial_heap/SE1G15Ao">Binomial heap</a></li> <li><a href="/facts/Fibonacci_heap/4cJIHkNQ">Fibonacci heap</a></li> <li><a href="/facts/2-3_heap/F1cnoDm1">2-3 heap</a></li></ul></li> <li><a href="/facts/Kd-tree/XuhcfKKq">Kd-tree</a></li> <li><a href="/facts/Cover_tree/1Mx05T5Q">Cover tree</a></li> <li><a href="/facts/Decision_tree/XDVeGlkJ">Decision tree</a></li> <li><a href="/facts/Empty_tree/Ro1YV0g6">Empty tree</a></li> <li><a href="/facts/Evolutionary_tree/f5vVEpeY">Evolutionary tree</a></li> <li><a href="/facts/Exponential_tree/IlXLv1Fn">Exponential tree</a></li> <li><a href="/facts/Family_tree/KxTrDYQA">Family tree</a></li> <li><a href="/facts/Fault_tree/rTD7Xd0t">Fault tree</a></li> <li><a href="/facts/Free_tree/TCWk4Joy">Free tree</a></li> <li><a href="/facts/Game_tree/qQX93S4l">Game tree</a></li> <li><a href="/facts/K-ary_tree/XAMJC3QW">K-ary tree</a></li> <li><a href="/facts/Octree/hNT74wvT">Octree</a></li> <li><a href="/facts/Parse_tree/FeBEtXcz">Parse tree</a></li> <li><a href="/facts/Phylogenetic_tree/f5vVEpeY">Phylogenetic tree</a></li> <li><a href="/facts/Polytree/pcJa4qeS">Polytree</a></li> <li>Positional tree</li> <li><a href="/facts/PQ_tree/7ldp45Y7">PQ tree</a></li> <li><a href="/facts/R-tree/9X5AQWln">R-tree</a></li> <li><a href="/facts/Rooted_tree/TCWk4Joy">Rooted tree</a> <ul><li><a href="/facts/Ordered_tree/TCWk4Joy">Ordered tree</a></li> <li><a href="/facts/Recursive_tree/GW33L27P">Recursive tree</a></li></ul></li> <li><a href="/facts/SPQR_tree/M5caazhq">SPQR tree</a></li> <li><a href="/facts/Suffix_tree/pdQdCxbe">Suffix tree</a></li> <li><a href="/facts/Technology_tree/AS2AeuSM">Technology tree</a></li> <li><a href="/facts/Trie/cXNr0ScT">Trie</a> <ul><li><a href="/facts/Patricia_trie/a1JKJPYc">Patricia trie</a></li></ul></li> <li><a href="/facts/Spanning_tree_(mathematics)/qQPN9taR">Spanning tree</a> <ul><li><a href="/facts/Minimum_spanning_tree/kgkGmY9s">Minimum spanning tree</a> <ul><li><a href="/facts/Boruvka%2527s_algorithm/Hs1pkNRB">Boruvka's algorithm</a></li> <li><a href="/facts/Kruskal%2527s_algorithm/sg8v1BHB">Kruskal's algorithm</a></li> <li><a href="/facts/Prim%2527s_algorithm/UHEcY2lH">Prim's algorithm</a></li></ul></li></ul></li> <li><a href="/facts/Steiner_tree/5mhCq8cN">Steiner tree</a></li> <li><a href="/facts/Quadtree/6b23FQoD">Quadtree</a></li></ul> <h3>Terminology</h3> <ul><li><a href="/facts/Node_(graph_theory)/WhlWmL3o">Node</a> <ul><li><a href="/facts/Child_node/RcXz9noF">Child node</a></li> <li><a href="/facts/Parent_node/RcXz9noF">Parent node</a></li> <li><a href="/facts/Leaf_node/RcXz9noF">Leaf node</a></li> <li><a href="/facts/Root_node/RcXz9noF">Root node</a></li> <li><a href="/facts/Root_(graph_theory)/TCWk4Joy">Root (graph theory)</a></li></ul></li></ul> <h3>Operations</h3> <ul><li><a href="/facts/Tree_rotation/R3SlGyI0">Tree rotation</a></li> <li><a href="/facts/Tree_traversal/Dkch34pz">Tree traversal</a> <ul><li><a href="/facts/Inorder_traversal/Dkch34pz">Inorder traversal</a></li> <li><a href="/facts/Backward_inorder_traversal/Dkch34pz">Backward inorder traversal</a></li> <li><a href="/facts/Pre-order_traversal/Dkch34pz">Pre-order traversal</a></li> <li><a href="/facts/Post-order_traversal/Dkch34pz">Post-order traversal</a></li> <li><a href="/facts/Ahnentafel/nlnFRK39">Ahnentafel</a></li></ul></li> <li><a href="/facts/Tree_search_algorithm/Dkch34pz">Tree search algorithm</a></li> <li><a href="/facts/A-star_search_algorithm/BXFmt6hz">A-star search algorithm</a></li> <li><a href="/facts/Best-first_search/jaIwMxBE">Best-first search</a></li> <li><a href="/facts/Breadth-first_search/2kulDXCx">Breadth-first search</a></li> <li><a href="/facts/Depth-first_search/luxJKVph">Depth-first search</a> <ul><li><a href="/facts/Iterative_deepening_depth-first_search/BezFNMTR">Iterative deepening depth-first search</a></li></ul></li></ul> <ul><li><a href="/facts/Tree_structure/R2vT5UIu">Tree structure</a></li> <li><a href="/facts/Tree_data_structure/RcXz9noF">Tree data structure</a></li> <li><a href="/facts/Cayley%2527s_formula/fwjWPJTf">Cayley's formula</a></li> <li><a href="/facts/K%25C5%2591nig%2527s_lemma/eCU93PN9">Kőnig's lemma</a></li> <li><a href="/facts/Tree_(set_theory)/5zkqfoz3">Tree (set theory)</a> (need not be a tree in the graph-theory sense, because there may not be a unique path between two vertices)</li> <li><a href="/facts/Tree_(descriptive_set_theory)/RqSGQaRG">Tree (descriptive set theory)</a></li> <li><a href="/facts/Euler_tour_technique/Yb6WNV3m">Euler tour technique</a></li></ul> <h2 id="graph-limits">Graph limits</h2> <ul><li><a href="/facts/Graphon/ezqevlSv">Graphon</a></li></ul> <h2 id="graphs-in-logic">Graphs in logic</h2> <ul><li><a href="/facts/Conceptual_graph/8cHXdCae">Conceptual graph</a></li> <li><a href="/facts/Entitative_graph/jfNE9JB7">Entitative graph</a></li> <li><a href="/facts/Existential_graph/o8ma2PcM">Existential graph</a></li> <li><i><a href="/facts/Laws_of_Form/rLNKFWqD">Laws of Form</a></i></li> <li><a href="/facts/Logical_graph/IMH9yIvX">Logical graph</a></li></ul> <h2 id="mazes-and-labyrinths">Mazes and labyrinths</h2> <ul><li><a href="/facts/Labyrinth/mRXBS2t1">Labyrinth</a></li> <li><a href="/facts/Maze/Bxn9dLxo">Maze</a></li> <li><a href="/facts/Maze_generation_algorithm/dS9dGW5p">Maze generation algorithm</a></li></ul> <h2 id="algorithms">Algorithms</h2> <p class="note">See also: <a href="/facts/Graph_algorithms/g3uenNkc">Graph algorithms</a> and <a href="/facts/Algorithm/fnl5NmRt">Algorithm</a></p> <ul><li><a href="/facts/Ant_colony_algorithm/SXGYs630">Ant colony algorithm</a></li> <li><a href="/facts/Breadth-first_search/2kulDXCx">Breadth-first search</a></li> <li><a href="/facts/Depth-first_search/luxJKVph">Depth-first search</a></li> <li><a href="/facts/Depth-limited_search/BezFNMTR">Depth-limited search</a></li> <li><a href="/facts/FKT_algorithm/GQYHD36K">FKT algorithm</a></li> <li><a href="/facts/Flood_fill/ehcLrEBg">Flood fill</a></li> <li><a href="/facts/Graph_exploration_algorithm/vFjrnHxr">Graph exploration algorithm</a></li> <li><a href="/facts/Matching_(graph_theory)/s0pUJ7hd">Matching (graph theory)</a></li> <li><a href="/facts/Max_flow_min_cut_theorem/qrXp2ut7">Max flow min cut theorem</a></li> <li>Maximum-cardinality search</li> <li><a href="/facts/Shortest_path_problem/g4nsrswr">Shortest path</a> <ul><li><a href="/facts/Dijkstra%2527s_algorithm/ehun88jl">Dijkstra's algorithm</a></li> <li><a href="/facts/Bellman%25E2%2580%2593Ford_algorithm/Sx6INcdr">Bellman–Ford algorithm</a></li> <li><a href="/facts/A-star_algorithm/BXFmt6hz">A* algorithm</a></li> <li><a href="/facts/Floyd%25E2%2580%2593Warshall_algorithm/fo2XUseS">Floyd–Warshall algorithm</a></li></ul></li> <li><a href="/facts/Topological_sorting/VY7gNtYA">Topological sorting</a> <ul><li><a href="/facts/Pre-topological_order/2UsSI0Ka">Pre-topological order</a></li></ul></li></ul> <h2 id="other-topics">Other topics</h2> <ul><li><a href="/facts/Adjacency_list/CYgNQoLp">Adjacency list</a></li> <li><a href="/facts/Adjacency_matrix/jYXNhYGs">Adjacency matrix</a> <ul><li><a href="/facts/Adjacency_algebra/comCvJDe">Adjacency algebra</a> – the algebra of polynomials in the adjacency matrix</li></ul></li> <li><a href="/facts/Canadian_traveller_problem/TNvAQ5JT">Canadian traveller problem</a></li> <li><a href="/facts/Clique_(graph_theory)/XK9ppLz5">Cliques</a> and <a href="/facts/Independent_set_(graph_theory)/ksu46kdz">independent sets</a> <ul><li><a href="/facts/Clique_problem/cVVBNP08">Clique problem</a></li></ul></li> <li><a href="/facts/Connected_component_(graph_theory)/5owVSXtY">Connected component</a></li> <li><a href="/facts/Cycle_space/NeWx2guT">Cycle space</a></li> <li><a href="/facts/De_Bruijn_sequences/jExlpx9H">de Bruijn sequences</a></li> <li><a href="/facts/Degree_diameter/uaGL4qFr">Degree diameter problem</a></li> <li><a href="/facts/Entanglement_(graph_measure)/r6huyJe5">Entanglement (graph measure)</a></li> <li><a href="/facts/Erd%25C5%2591s%25E2%2580%2593Gy%25C3%25A1rf%25C3%25A1s_conjecture/JPX36lmC">Erdős–Gyárfás conjecture</a></li> <li><a href="/facts/Eternal_dominating_set/Q2Pdkfv9">Eternal dominating set</a></li> <li><a href="/facts/Extremal_graph_theory/mdkBX6yN">Extremal graph theory</a> <ul><li><a href="/facts/Critical_graph/bPg9g1B2">Critical graph</a></li> <li><a href="/facts/Tur%25C3%25A1n%2527s_theorem/opMCT84y">Turán's theorem</a></li></ul></li> <li><a href="/facts/Frequency_partition/39zwn0ss">Frequency partition</a></li> <li><a href="/facts/Frucht%2527s_theorem/qsedoaEV">Frucht's theorem</a></li> <li><a href="/facts/Girth_(graph_theory)/rPwRGgxj">Girth</a></li> <li><a href="/facts/Graph_drawing/uhh73BVo">Graph drawing</a></li> <li><a href="/facts/Graph_homomorphism/XSljQ25z">Graph homomorphism</a></li> <li><a href="/facts/Graph_labeling/ux5jKRD7">Graph labeling</a> <ul><li><a href="/facts/Graceful_labeling/Do7bxMnc">Graceful labeling</a></li></ul></li> <li><a href="/facts/Graph_partition/MSQF0WyD">Graph partition</a></li> <li><a href="/facts/Graph_pebbling/B1aM1jlU">Graph pebbling</a></li> <li><a href="/facts/Graph_property/bjuIvgb1">Graph property</a></li> <li><a href="/facts/Graph_reduction/8EsDncj4">Graph reduction</a></li> <li><a href="/facts/Graph-structured_stack/lF74CGza">Graph-structured stack</a></li> <li><a href="/facts/Graphical_model/XxfmKhmM">Graphical model</a> <ul><li><a href="/facts/Bayesian_network/Ry31vq6T">Bayesian network</a></li> <li><a href="/facts/D-separation/Ry31vq6T">D-separation</a></li> <li><a href="/facts/Markov_random_field/DJazwaeP">Markov random field</a></li></ul></li> <li><a href="/facts/Tree_decomposition/p31V5rM2">Tree decomposition</a> (<a href="/facts/Junction_tree/p31V5rM2">Junction tree</a>) and <a href="/facts/Treewidth/uoITxzRJ">treewidth</a></li> <li>Graph triangulation (see also <a href="/facts/Chordal_graph/7hNerUdA">Chordal graph</a>)</li> <li>Perfect order</li> <li><a href="/facts/Hidden_Markov_model/ur1zTAhP">Hidden Markov model</a> <ul><li><a href="/facts/Baum%25E2%2580%2593Welch_algorithm/8kW1Ajxx">Baum–Welch algorithm</a></li> <li><a href="/facts/Viterbi_algorithm/FYoyJ6YY">Viterbi algorithm</a></li></ul></li> <li><a href="/facts/Incidence_matrix/eMXGWQBw">Incidence matrix</a></li> <li><a href="/facts/Independent_set_problem/ksu46kdz">Independent set problem</a></li> <li><a href="/facts/Knowledge_representation/9lnzyILD">Knowledge representation</a> <ul><li><a href="/facts/Conceptual_graph/8cHXdCae">Conceptual graph</a></li> <li><a href="/facts/Mind_map/4ytd9gIw">Mind map</a></li></ul></li> <li><a href="/facts/Level_structure/fgKemoho">Level structure</a></li> <li><a href="/facts/Link_popularity/KKVBqy8b">Link popularity</a></li> <li><a href="/facts/Mac_Lane%2527s_planarity_criterion/F6LQxPSz">Mac Lane's planarity criterion</a></li> <li><a href="/facts/Node_influence_metric/8rI6lbKK">Node influence metric</a></li> <li><a href="/facts/Reconstruction_conjecture/sYv3VVEI">Reconstruction conjecture</a></li> <li><a href="/facts/Scientific_classification/Qkg8wuyw">Scientific classification</a> <ul><li><a href="/facts/Cladistics/JasKVABk">Cladistics</a></li> <li><a href="/facts/Neighbor-joining/Yld9VDz5">Neighbor-joining</a></li> <li><a href="/facts/Phenetics/aTqXrJEl">Phenetics</a></li></ul></li> <li><a href="/facts/Tur%25C3%25A1n_number/JYtIoUjf">Turán number</a></li> <li><a href="/facts/Shannon_switching_game/nkk6591n">Shannon switching game</a></li> <li><a href="/facts/Spectral_graph_theory/tBttgGTh">Spectral graph theory</a></li> <li><a href="/facts/Spring-based_algorithm/CWAwEwXW">Spring-based algorithm</a></li> <li><a href="/facts/Strongly_connected_component/P6rBqb7W">Strongly connected component</a></li> <li><a href="/facts/Vertex_cover_problem/WK86bJvf">Vertex cover problem</a></li></ul> <h2 id="networks-network-theory">Networks, <a href="/facts/Network_theory/m6CQovwm">network theory</a></h2> <p><i>See <a href="/facts/List_of_network_theory_topics/d0pz62qP">list of network theory topics</a></i> </p> <h2 id="hypergraphs"><a href="/facts/Hypergraph/qIR2o2I3">Hypergraphs</a></h2> <ul><li><a href="/facts/Helly_family/hrEeK6Rx">Helly family</a></li> <li><a href="/facts/Intersection_(Line)_Graphs_of_hypergraphs/zAIeFAWT">Intersection (Line) Graphs of hypergraphs</a></li></ul>