Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02624551n
Noun Concept
ES
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
grafo no dirigido
HAS KIND
EN
rook's graph
HAS INSTANCE
grafo de Durero
STUDIED BY
teoría de grafos

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