About: Χ-bounded

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In graph theory, a -bounded family of graphs is one for which there is some function such that, for every integer the graphs in with (clique number) can be colored with at most colors. This concept and its notation were formulated by András Gyárfás. The use of the Greek letter chi in the term -bounded is based on the fact that the chromatic number of a graph is commonly denoted .

Property Value
dbo:abstract
  • In graph theory, a -bounded family of graphs is one for which there is some function such that, for every integer the graphs in with (clique number) can be colored with at most colors. This concept and its notation were formulated by András Gyárfás. The use of the Greek letter chi in the term -bounded is based on the fact that the chromatic number of a graph is commonly denoted . (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 56030164 (xsd:integer)
dbo:wikiPageLength
  • 10888 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1110448579 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In graph theory, a -bounded family of graphs is one for which there is some function such that, for every integer the graphs in with (clique number) can be colored with at most colors. This concept and its notation were formulated by András Gyárfás. The use of the Greek letter chi in the term -bounded is based on the fact that the chromatic number of a graph is commonly denoted . (en)
rdfs:label
  • Χ-bounded (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License