Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
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
IS A
concept
number of entities
STUDIED BY
graph theory
Wikipedia
EN
degeneracy (graph theory)
Wikidata
EN
Degeneracy
Wikipedia Redirections
EN
coloring number, Colouring number, Graph degeneracy, k-core, k-cores, Szekeres-Wilf number, Szekeres–Wilf number

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License