Linked from

The 97 pages that link to Graph theory, each with the reason it gives.

• Hamiltonian path problemNarrower topic: Hamiltonian paths are defined by the vertices and edges of a graph.

• Kőnig's lemmaNarrower topic: The lemma emerged from the study of infinite graphs and tree structure.

• Matching polynomialNarrower topic: The matching polynomial emerged as an invariant of graph structure.

• Travelling salesman problemNarrower topic: Cities become vertices and possible journeys become edges in the standard model.

• Dynamics of networksNarrower topic: Its graph representation supplies the basic language for describing network structure.

• Edge coverNarrower topic: Edge covers are defined using the vertices and edges of a graph.

• Fáry's theoremNarrower topic: Fáry's theorem concerns how graph connectivity can be represented geometrically.

• MazeNarrower topic: A maze can be modeled as a graph whose junctions are vertices and corridors are edges.

• Nine Men's MorrisNarrower topic: The board can be modeled as points joined by legal movement paths.

• Tellegen's theoremNarrower topic: The theorem's algebraic proof depends on the graph underlying the lumped network.

• Biological network methodsNarrower topic: Provides the formal language for representing biological entities and their relationships.

• Bunkbed conjectureNarrower topic: The conjecture is a graph-probability problem built from finite graphs.

• Chinese checkersNarrower topic: The star board can be modeled as spaces joined by legal movement paths.

• Collective behavior in networksNarrower topic: It supplies the formal language for describing who is connected to whom.

• Conway's thrackle conjectureNarrower topic: The conjecture bounds edges against vertices in a graph.

• Directed networkNarrower topic: Directed networks are graph-theoretic structures with an orientation rule.

• Evolving networksNarrower topic: It supplies the basic language for describing network nodes and links.

• Exponential networkNarrower topic: Exponential networks are graphs characterized by how their edges are distributed.

• Fleischner's theoremNarrower topic: The theorem is a central result in structural graph theory.

• Friends and strangers theoremNarrower topic: The theorem’s people-and-relationships setup becomes a graph with six vertices.

• Generalized Petersen graphNarrower topic: Generalized Petersen graphs became a recurring test family for structural questions.

• Hedetniemi's conjectureNarrower topic: The conjecture arose within graph theory's study of coloring and graph products.

• Homogeneous networkNarrower topic: Homogeneity is defined by properties assigned to a graph’s vertices or edges.

• Kruskal's tree theoremNarrower topic: The theorem arose from questions about ordering finite graph structures.

• Lovász conjectureNarrower topic: The conjecture is a central open problem in this field.

• Mahjong solitaireNarrower topic: A layout can be modeled as a changing network of tile-blocking relationships.

• Multilayer and multiplex networksNarrower topic: Multilayer models extend ordinary graphs by organizing edges and vertices across layers.

• Network formation & growthNarrower topic: Network growth builds on graph concepts for representing nodes and links.

• Peg solitaireNarrower topic: A board can be represented by holes and their spatial relations.

• Rail transport modellingNarrower topic: Rail networks can be encoded as connected nodes and links for routing and analysis.

• Robbins' theoremNarrower topic: Robbins' theorem is a classic result about connectivity and edge orientation.

• Three utilities problemNarrower topic: Graph theory turns houses and utilities into vertices and connections into edges.

• Tutte's theorem on perfect matchingsNarrower topic: Tutte's theorem is a structural result about finite graphs.