Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02624551n
Noun Concept
JA
No term available
EN
In graph theory, a well-covered graph is an undirected graph in which every minimal vertex cover has the same size as every other minimal vertex cover. Wikipedia
Relations
Sources
IS A
EN
undirected graph
HAS KIND
ルークのグラフ
HAS INSTANCE
デューラーグラフ
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