Linked from

The 15 pages that link to Connected component, each with the reason it gives.

• Bipartite graphRelated: Each component can be colored independently, including isolated vertices.

• Incidence matrixRelated: For an oriented incidence matrix, the rank is the vertex count minus the number of connected components.

• Vertex (graph theory)Related: The component containing a vertex identifies everything reachable from it.

• Breadth-first searchRelated: A traversal from one vertex visits exactly its component in an undirected graph.

• Jordan curve theoremNarrower topic: The theorem says the curve's complement has exactly two such components.

• Depth-first searchRelated: A DFS started at one vertex visits exactly its connected component in an undirected graph.

• Path (graph theory)Narrower topic: Paths determine which vertices belong to the same connected component.

• Connected spaceBroader topic: Connected components partition any space into its largest connected pieces.

• Connected graphBroader topic: Each component is a connected subgraph when the whole graph is disconnected.

• Undirected graphBroader topic: Components partition an undirected graph according to reachability.

• Runge's theoremRelated: The complement's connected components determine which pole locations can be replaced by polynomials.

• Kruskal's algorithmRelated: The algorithm merges components until only one remains.

• Edge contractionRelated: Contracting an edge does not change the number of connected components.

• Laplacian matrixRelated: The number of zero Laplacian eigenvalues equals the number of connected components.

• Tutte's theorem on perfect matchingsRelated: The theorem counts components after the chosen vertices are removed.