Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Well-covered_graph> ?p ?o }
- 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 v16i2r2.html.
- Well-covered_graph wikiPageExternalLink ADA247861.
- Well-covered_graph wikiPageID "32696387".
- Well-covered_graph wikiPageLength "24345".
- Well-covered_graph wikiPageOutDegree "65".
- Well-covered_graph wikiPageRevisionID "646610170".
- Well-covered_graph wikiPageWikiLink Bridge_(graph_theory).
- Well-covered_graph wikiPageWikiLink Category:Graph_families.
- Well-covered_graph wikiPageWikiLink Chessboard.
- Well-covered_graph wikiPageWikiLink Claw-free_graph.
- Well-covered_graph wikiPageWikiLink Clique_complex.
- Well-covered_graph wikiPageWikiLink Clique_cover_problem.
- Well-covered_graph wikiPageWikiLink Complement_(set_theory).
- Well-covered_graph wikiPageWikiLink Complete_bipartite_graph.
- Well-covered_graph wikiPageWikiLink Complete_graph.
- Well-covered_graph wikiPageWikiLink Connectivity_(graph_theory).
- Well-covered_graph wikiPageWikiLink Convex_polyhedron.
- Well-covered_graph wikiPageWikiLink Convex_polytope.
- Well-covered_graph wikiPageWikiLink Critical_graph.
- Well-covered_graph wikiPageWikiLink Cubic_graph.
- Well-covered_graph wikiPageWikiLink Cycle_graph.
- Well-covered_graph wikiPageWikiLink Degree_(graph_theory).
- Well-covered_graph wikiPageWikiLink Deltahedron.
- Well-covered_graph wikiPageWikiLink Discrete_Mathematics_(journal).
- Well-covered_graph wikiPageWikiLink Dürer_graph.
- Well-covered_graph wikiPageWikiLink Euler_characteristic.
- Well-covered_graph wikiPageWikiLink Generalized_Petersen_graph.
- Well-covered_graph wikiPageWikiLink Girth_(graph_theory).
- Well-covered_graph wikiPageWikiLink Glossary_of_graph_theory.
- Well-covered_graph wikiPageWikiLink Graph_(mathematics).
- Well-covered_graph wikiPageWikiLink Graph_theory.
- Well-covered_graph wikiPageWikiLink Hamiltonian_cycle.
- Well-covered_graph wikiPageWikiLink Hamiltonian_path.
- Well-covered_graph wikiPageWikiLink Independent_set_(graph_theory).
- Well-covered_graph wikiPageWikiLink Induced_subgraph.
- Well-covered_graph wikiPageWikiLink Intersection_graph.
- Well-covered_graph wikiPageWikiLink Interval_(mathematics).
- Well-covered_graph wikiPageWikiLink Journal_of_Combinatorial_Theory.
- Well-covered_graph wikiPageWikiLink K-vertex-connected_graph.
- Well-covered_graph wikiPageWikiLink Line_graph.
- Well-covered_graph wikiPageWikiLink Matching_(graph_theory).
- Well-covered_graph wikiPageWikiLink Maximal_element.
- Well-covered_graph wikiPageWikiLink Maximal_matching.
- Well-covered_graph wikiPageWikiLink Minimal_element.
- Well-covered_graph wikiPageWikiLink NP-complete.
- Well-covered_graph wikiPageWikiLink NP-completeness.
- Well-covered_graph wikiPageWikiLink Octahedron.
- Well-covered_graph wikiPageWikiLink Open_interval.
- Well-covered_graph wikiPageWikiLink Pentagonal_bipyramid.
- Well-covered_graph wikiPageWikiLink Pentagonal_dipyramid.
- Well-covered_graph wikiPageWikiLink Pentagonal_prism.
- Well-covered_graph wikiPageWikiLink Perfect_matching.
- Well-covered_graph wikiPageWikiLink Planar_graph.
- Well-covered_graph wikiPageWikiLink Polyhedral_graph.
- Well-covered_graph wikiPageWikiLink Polynomial_time.
- Well-covered_graph wikiPageWikiLink Regular_graph.
- Well-covered_graph wikiPageWikiLink Regular_octahedron.
- Well-covered_graph wikiPageWikiLink Rook_(chess).
- Well-covered_graph wikiPageWikiLink Rooks_graph.
- Well-covered_graph wikiPageWikiLink Rooted_product_of_graphs.
- Well-covered_graph wikiPageWikiLink Simple_polytope.
- Well-covered_graph wikiPageWikiLink Simplicial_complex.
- Well-covered_graph wikiPageWikiLink Simplicial_polytope.
- Well-covered_graph wikiPageWikiLink Snub_disphenoid.
- Well-covered_graph wikiPageWikiLink Three_utilities_problem.
- Well-covered_graph wikiPageWikiLink Time_complexity.
- Well-covered_graph wikiPageWikiLink Transactions_of_the_American_Mathematical_Society.
- Well-covered_graph wikiPageWikiLink Triangular_prism.
- Well-covered_graph wikiPageWikiLink Triangulation_(geometry).
- Well-covered_graph wikiPageWikiLink Undirected_graph.
- Well-covered_graph wikiPageWikiLink Utility_graph.
- Well-covered_graph wikiPageWikiLink Vertex_cover.
- Well-covered_graph wikiPageWikiLink Y-Δ_transform.
- Well-covered_graph wikiPageWikiLink File:3r1c_well-covered.svg.
- Well-covered_graph wikiPageWikiLink File:3r3c_well-covered.svg.
- Well-covered_graph wikiPageWikiLink File:Snub_disphenoid.png.
- Well-covered_graph wikiPageWikiLink File:Well-covered_graph.svg.
- Well-covered_graph wikiPageWikiLinkText "well-covered graph".
- Well-covered_graph wikiPageWikiLinkText "well-covered".
- Well-covered_graph hasPhotoCollection Well-covered_graph.
- Well-covered_graph wikiPageUsesTemplate Template:Chess_diagram.
- Well-covered_graph wikiPageUsesTemplate Template:Citation.
- Well-covered_graph wikiPageUsesTemplate Template:Harvtxt.
- Well-covered_graph wikiPageUsesTemplate Template:Math.
- Well-covered_graph wikiPageUsesTemplate Template:Mvar.
- Well-covered_graph wikiPageUsesTemplate Template:Refbegin.
- Well-covered_graph wikiPageUsesTemplate Template:Refend.
- Well-covered_graph wikiPageUsesTemplate Template:Reflist.
- Well-covered_graph subject Category:Graph_families.
- Well-covered_graph hypernym Graph.
- Well-covered_graph type Software.
- Well-covered_graph type Graph.
- 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 wasDerivedFrom Well-covered_graph?oldid=646610170.