Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Well-covered_graph> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- Well-covered_graph abstract "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. Well-covered graphs were defined and first studied by Plummer (1970).".
- Well-covered_graph thumbnail Well-covered_graph.svg?width=300.
- Well-covered_graph wikiPageExternalLink ADA247861.
- Well-covered_graph wikiPageExternalLink v16i2r2.html.
- Well-covered_graph wikiPageID "32696387".
- Well-covered_graph wikiPageRevisionID "552653702".
- Well-covered_graph hasPhotoCollection Well-covered_graph.
- Well-covered_graph subject Category:Graph_families.
- Well-covered_graph type Abstraction100002137.
- Well-covered_graph type Family108078020.
- Well-covered_graph type GraphFamilies.
- Well-covered_graph type Group100031264.
- Well-covered_graph type Organization108008335.
- Well-covered_graph type SocialGroup107950920.
- Well-covered_graph type Unit108189659.
- Well-covered_graph type YagoLegalActor.
- Well-covered_graph type YagoLegalActorGeo.
- Well-covered_graph type YagoPermanentlyLocatedEntity.
- Well-covered_graph comment "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. Well-covered graphs were defined and first studied by Plummer (1970).".
- Well-covered_graph label "Well-covered graph".
- Well-covered_graph sameAs m.0h3rq4f.
- Well-covered_graph sameAs Q7981049.
- Well-covered_graph sameAs Q7981049.
- Well-covered_graph sameAs Well-covered_graph.
- Well-covered_graph wasDerivedFrom Well-covered_graph?oldid=552653702.
- Well-covered_graph depiction Well-covered_graph.svg.
- Well-covered_graph isPrimaryTopicOf Well-covered_graph.
