Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02114701n
Noun Concept
JA
No term available
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
Relations
Sources
IS A
概念
値
STUDIED BY
グラフ理論

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