Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02624551n
Noun Concept
Categories: Graph families
EN
well-covered graph
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
Definitions
Relations
Sources
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
Graph with equal-size maximal independent sets Wikidata
IS A
undirected graph
HAS KIND
rook's graph
HAS INSTANCE
Dürer graph
STUDIED BY
graph theory
Wikipedia
EN
well-covered graph
Wikidata
EN
well-covered graph

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