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:
Trivially perfect graph
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia-live.demo.openlinksw.com
Graph where every connected induced subgraph has a universal vertex
Property
Value
dbo:
description
граф, у кожному породженому підграфі якого розмір найбільшої (за розміром) незалежної множини дорівнює числу найбільших клік
(uk)
graph where every connected induced subgraph has a universal vertex
(en)
граф со свойством, что в каждом его порождённом подграфе размер максимального (по размеру) независимого множества равен числу максимальных клик
(ru)
גרף שבו לכל תת-גרף המושרה מחובר יש קודקוד אוניברסלי
(iw)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Trivially_perfect_graph.svg?width=300
dbo:
wikiPageExternalLink
https://archive.org/details/graphclassessurv0000bran
http://www.graphclasses.org/classes/gc_327.html
dbo:
wikiPageWikiLink
dbr
:Stack-sortable_permutation
dbr
:Clique_number
dbr
:Maximal_clique
dbr
:Interval_(mathematics)
dbr
:Maximum_independent_set
dbr
:Clique_cover_number
dbr
:Big_O_notation
dbr
:Complement_graph
dbr
:Tree_(set_theory)
dbr
:Proceedings_of_the_American_Mathematical_Society
dbr
:Cycle_graph
dbc
:Perfect_graphs
dbr
:Chordal_graph
dbr
:Interval_graph
dbr
:Graph_theory
dbr
:Chromatic_number
dbr
:Cograph
dbr
:Induced_subgraph
dbr
:Ptolemaic_graph
dbr
:Information_Processing_Letters
dbr
:Partial_order
dbr
:Discrete_Mathematics_(journal)
dbr
:Path_graph
dbc
:Graph_families
dbr
:Threshold_graph
dbr
:Comparability_graph
dbr
:Permutation_graph
dbr
:Perfect_graph
dbr
:Discrete_Applied_Mathematics
dbr
:Windmill_graph
dbr
:Lexicographic_breadth-first_search
dbr
:Relation_(mathematics)
dbr
:NP-complete
dbr
:Universal_vertex
dbr
:Linear_time
dbr
:Induced_path
dbr
:Well-ordered
dbr
:Neighborhood_(graph_theory)
dbr
:File:Trivially_perfect_graph.svg
dbr
:Pseudo-Grundy_number
dbp:
last
Wolk
(en)
dbp:
wikiPageUsesTemplate
dbt
:Reflist
dbt
:Math
dbt
:Sub
dbt
:Sup
dbt
:Citation
dbt
:Refend
dbt
:Sfnp
dbt
:Refbegin
dbt
:Mvar
dbt
:Harvs
dbt
:Harvtxt
dbt
:Short_description
dbp:
year
1962
(xsd:integer)
1965
(xsd:integer)
dct:
subject
dbc
:Perfect_graphs
dbc
:Graph_families
gold:
hypernym
dbr
:Graph
rdfs:
label
Trivially perfect graph
(en)
Graphe trivialement parfait
(fr)
Тривиально совершенный граф
(ru)
Тривіально досконалий граф
(uk)
owl:
sameAs
freebase
:Trivially perfect graph
yago-res
:Trivially perfect graph
wikidata
:Trivially perfect graph
dbpedia-fr
:Trivially perfect graph
dbpedia-ru
:Trivially perfect graph
dbpedia-uk
:Trivially perfect graph
dbpedia-global
:Trivially perfect graph
dbr
:Trivially perfect graph
prov:
wasDerivedFrom
wikipedia-en
:Trivially_perfect_graph?oldid=1265819642&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Trivially_perfect_graph.svg
foaf:
isPrimaryTopicOf
wikipedia-en
:Trivially_perfect_graph
is
dbo:
wikiPageRedirects
of
dbr
:Aborescent_comparability_graph
dbr
:Comparability_graph_of_trees
dbr
:Comparability_graphs_of_trees
dbr
:Quasi-threshold_graph
is
dbo:
wikiPageWikiLink
of
dbr
:Planar_separator_theorem
dbr
:Stack-sortable_permutation
dbr
:Forbidden_graph_characterization
dbr
:Tree_(set_theory)
dbr
:Interval_graph
dbr
:Cograph
dbr
:Indifference_graph
dbr
:Tree-depth
dbr
:Distance-hereditary_graph
dbr
:Threshold_graph
dbr
:Comparability_graph
dbr
:Perfect_graph
dbr
:Windmill_graph
dbr
:Chordal_completion
dbr
:Aborescent_comparability_graph
dbr
:Universal_vertex
dbr
:Induced_path
dbr
:Comparability_graph_of_trees
dbr
:Comparability_graphs_of_trees
dbr
:Quasi-threshold_graph
is
foaf:
primaryTopic
of
wikipedia-en
:Trivially_perfect_graph
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International