bn:02114701n
Noun Concept
Categories: Graph algorithms, Graph invariants
EN
degeneracy  coloring number  Colouring number  Graph degeneracy  k-core
EN
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. Wikipedia
English:
graph theory
Definitions
Relations
Sources
EN
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. Wikipedia
A measure of the sparseness of a graph Wikipedia Disambiguation
mathematical concept Wikidata