claim: Barbarella is comedy.
evidence: `` K-core '' redirects here .. core. core ( graph theory ). The core of a graph is a different concept .. core. core ( graph theory ). In graph theory , a k-degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k  : that is , some vertex in the subgraph touches k or fewer of the subgraph 's edges .. graph theory. graph theory. undirected graph. undirected graph. degree. degree ( graph theory ). The degeneracy of a graph is the smallest value of k for which it is k-degenerate .. The degeneracy of a graph is a measure of how sparse it is , and is within a constant factor of other sparsity measures such as the arboricity of a graph .. sparse. dense graph. arboricity. arboricity. Degeneracy is also known as the k-core number , width , and linkage , and is essentially the same as the coloring number or Szekeres-Wilf number -LRB- named after -RRB- .. core. core ( graph theory ). k-degenerate graphs have also been called k-inductive graphs .. The degeneracy of a graph may be computed in linear time by an algorithm that repeatedly removes minimum-degree vertices .. degree. degree ( graph theory ). linear time. linear time. The connected components that are left after all vertices of degree less than k have been removed are called the k-cores of the graph and the degeneracy of a graph is the largest value k such that it has a k-core .. core. core ( graph theory ). degree. degree ( graph theory ). connected components. Connected component ( graph theory )