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