Linked from

The 29 pages that link to Graph (discrete mathematics), each with the reason it gives.

• Planar graphNarrower topic: Planarity is a property of graphs, defined by whether their vertices and edges admit a suitable drawing.

• Adjacency matrixNarrower topic: An adjacency matrix is one representation of this broader structure.

• Complete graphNarrower topic: A complete graph is a special case of this general structure.

• Edge (graph theory)Narrower topic: Edges are the connecting elements in this broader mathematical structure.

• Vertex (graph theory)Narrower topic: A vertex is one of the two fundamental kinds of objects in a graph.

• Matching (graph theory)Narrower topic: A matching is defined by selecting edges from a graph.

• MultigraphNarrower topic: A multigraph extends this broader structure by allowing repeated edges.

• Path (graph theory)Narrower topic: A path is a particular sequence of vertices and edges within a graph.

• Degree (graph theory)Narrower topic: Degree measures how many edge ends meet each vertex in this structure.

• Tree (graph theory)Narrower topic: A tree is a graph constrained by connectivity and the absence of cycles.

• Bipartite matchingNarrower topic: A matching is a selected subset of a graph's edges.

• Line graphNarrower topic: The line graph is a transformation applied to an original graph.

• Connected graphNarrower topic: Connectedness is a property defined for graphs.

• Flow networkNarrower topic: The network is a graph with added directions and capacity limits.

• Eulerian pathNarrower topic: The arrangement of vertices and edges determines whether an Eulerian path exists.

• Odd cycleNarrower topic: An odd cycle is a substructure formed from a graph’s vertices and edges.

• Induced subgraphNarrower topic: An induced subgraph inherits its vertices and edges from this broader structure.

• Handshaking lemmaNarrower topic: The lemma is a universal counting fact about finite undirected graphs.

• Petersen graphNarrower topic: The Petersen graph is a finite graph with ten vertices and fifteen edges.

• Vertex-transitive graphNarrower topic: Vertex-transitivity is a symmetry property of this underlying structure.

• Kruskal's algorithmNarrower topic: Kruskal's algorithm operates on weighted graphs.

• Kirchhoff's theoremNarrower topic: The theorem applies to finite graphs and their spanning trees.

• Edge contractionNarrower topic: Edge contraction is defined by transforming a graph's vertices and edges.

• Laplacian matrixNarrower topic: The Laplacian is built from a graph’s vertices and edges.

• Maximum-cardinality matchingNarrower topic: Matchings select edges from this underlying structure.

• Intersection graphNarrower topic: An intersection graph is a graph whose edges encode pairwise intersections.

• Erdős–Gyárfás conjectureNarrower topic: The conjecture concerns finite graphs and imposes a condition on every vertex.