Explore relationships

K-core

In graph theory, a k-degenerate graph is an undirected graph in which every non-empty subgraph has at least one vertex of degree at most k{\displaystyle k}. That is, some vertex in the subgraph touches k{\displaystyle k} or fewer of the subgraph's edges.

Use + to expand a branch. Click a topic name to open its summary.