• Home
  • Random
  • Nearby
  • Log in
  • Settings
Donate Now If Wikipedia is useful to you, please give today.
  • About Wikipedia
  • Disclaimers
Wikipedia

Category:Graph connectivity

  • Category
  • Talk
  • Language
  • Watch
  • Edit
The main article for this category is Connectivity (graph theory).

Pages in category "Graph connectivity"

The following 38 pages are in this category, out of 38 total. This list may not reflect recent changes.

 

  • Connectivity (graph theory)

0–9

  • 1-vs-2 cycles problem

A

  • Algebraic connectivity

B

  • Balinski's theorem
  • Biconnected component
  • Biconnected graph
  • Bridge (graph theory)

C

  • Component (graph theory)
  • Connected dominating set
  • Cut (graph theory)
  • Cycle rank

E

  • Edge connectivity

G

  • Gammoid
  • Giant component
  • Graph toughness
  • Graphic matroid

K

  • Karger's algorithm
  • Kosaraju's algorithm

M

  • Menger's theorem

P

  • Path (graph theory)
  • Path-based strong component algorithm
  • Pixel connectivity

R

  • Rank (graph theory)
  • Reachability
  • Robbins' theorem

S

  • SPQR tree
  • St-connectivity
  • Stoer–Wagner algorithm
  • Strength of a graph
  • Strong connectivity augmentation
  • Strong orientation
  • Strongly connected component
  • Structural cohesion

T

  • Tarjan's strongly connected components algorithm

U

  • Uniconnected subgraph

V

  • Vertex connectivity
  • Vertex separator

W

  • Weak component
Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Graph_connectivity&oldid=545779698"