Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Well-covered graph
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Graph with equal-size maximal independent sets
Property
Value
dbo:
description
graf z enako velikimi največjimi neodvisnimi množicami
(sl)
graph with equal-size maximal independent sets
(en)
неориентированный граф, в котором любое минимальное вершинное покрытие имеет один и тот же размер
(ru)
Graph, dessen maximal unabhängigen Mengen gleich groß sind
(de)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Well-covered_graph.svg?width=300
dbo:
wikiPageExternalLink
http://handle.dtic.mil/100.2/ADA247861
https://web.archive.org/web/20120527164352/http:/handle.dtic.mil/100.2/ADA247861
http://www.combinatorics.org/Volume_16/Abstracts/v16i2r2.html
dbo:
wikiPageWikiLink
dbr
:Girth_(graph_theory)
dbr
:Y-Δ_transform
dbr
:Perfect_matching
dbr
:Rook_(chess)
dbr
:Electronic_Journal_of_Combinatorics
dbr
:Triangulation_(geometry)
dbr
:Snub_disphenoid
dbr
:Intersection_graph
dbr
:Clique_cover
dbr
:Graph_theory
dbr
:Chessboard
dbr
:Complement_(set_theory)
dbr
:Critical_graph
dbr
:Claw-free_graph
dbr
:Clique_complex
dbr
:Simplicial_polytope
dbr
:Complete_bipartite_graph
dbr
:Induced_subgraph
dbr
:Complete_graph
dbr
:Dürer_graph
dbr
:K-vertex-connected_graph
dbr
:Vertex_cover
dbr
:Planar_graph
dbr
:Regular_graph
dbr
:Deltahedron
dbr
:Generalized_Petersen_graph
dbr
:Discrete_Applied_Mathematics
dbr
:Cluster_graph
dbr
:Convex_polyhedron
dbr
:Independent_set_(graph_theory)
dbr
:Triangular_prism
dbr
:Bridge_(graph_theory)
dbr
:Ars_Combinatoria_(journal)
dbr
:Regular_octahedron
dbr
:Journal_of_Combinatorial_Theory
dbr
:Cycle_graph
dbr
:Euler_characteristic
dbr
:Simplicial_complex
dbr
:Transactions_of_the_American_Mathematical_Society
dbr
:Simple_polytope
dbr
:Connectivity_(graph_theory)
dbr
:Degree_(graph_theory)
dbr
:Pentagonal_prism
dbr
:Discrete_Mathematics_(journal)
dbr
:Polyhedral_graph
dbr
:Rook's_graph
dbr
:Rooted_product_of_graphs
dbr
:Undirected_graph
dbr
:Cubic_graph
dbr
:Line_graph
dbr
:Polynomial_time
dbr
:Michael_D._Plummer
dbc
:Graph_families
dbr
:Maximal_matching
dbr
:Utility_graph
dbr
:Open_interval
dbr
:Hamiltonian_cycle
dbr
:NP-complete
dbr
:CoNP-complete
dbr
:Minimal_element
dbr
:Pentagonal_dipyramid
dbr
:File:Snub_disphenoid.png
dbr
:File:3r1c_well-covered.svg
dbr
:File:3r3c_well-covered.svg
dbr
:File:Well-covered_graph.svg
dbp:
wikiPageUsesTemplate
dbt
:Good_article
dbt
:Chess_diagram
dbt
:Citation
dbt
:Harvtxt
dbt
:Math
dbt
:Mvar
dbt
:Refbegin
dbt
:Refend
dbt
:Reflist
dbt
:Sfnp
dbt
:Short_description
dct:
subject
dbc
:Graph_families
gold:
hypernym
dbr
:Graph
rdfs:
label
Well-covered graph
(en)
Хорошо покрытый граф
(ru)
owl:
sameAs
yago-res
:Well-covered graph
freebase
:Well-covered graph
wikidata
:Well-covered graph
dbpedia-ru
:Well-covered graph
dbpedia-global
:Well-covered graph
prov:
wasDerivedFrom
wikipedia-en
:Well-covered_graph?oldid=1235224887&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/3r1c_well-covered.svg
wiki-commons
:Special:FilePath/3r3c_well-covered.svg
wiki-commons
:Special:FilePath/Well-covered_graph.svg
wiki-commons
:Special:FilePath/Snub_disphenoid.png
foaf:
isPrimaryTopicOf
wikipedia-en
:Well-covered_graph
is
dbo:
wikiPageWikiLink
of
dbr
:Snub_disphenoid
dbr
:Three_utilities_problem
dbr
:Lorna_Stewart
dbr
:Glossary_of_graph_theory
dbr
:Dürer_graph
dbr
:Generalized_Petersen_graph
dbr
:Cluster_graph
dbr
:Maximal_independent_set
dbr
:Octahedron
dbr
:Pentagonal_bipyramid
dbr
:Clique_problem
dbr
:Rook's_graph
dbr
:Rooted_product_of_graphs
dbr
:Michael_D._Plummer
dbr
:Odile_Favaron
is
dbp:
properties
of
dbr
:Dürer_graph
dbr
:Rook's_graph
is
foaf:
primaryTopic
of
wikipedia-en
:Well-covered_graph
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International