About: Well-colored graph

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

In graph theory, a subfield of mathematics, a well-colored graph is an undirected graph for which greedy coloring uses the same number of colors regardless of the order in which colors are chosen for its vertices. That is, for these graphs, the chromatic number (minimum number of colors) and Grundy number (maximum number of greedily-chosen colors) are equal.

thumbnail
Property Value
dbo:abstract
  • In graph theory, a subfield of mathematics, a well-colored graph is an undirected graph for which greedy coloring uses the same number of colors regardless of the order in which colors are chosen for its vertices. That is, for these graphs, the chromatic number (minimum number of colors) and Grundy number (maximum number of greedily-chosen colors) are equal. (en)
dbo:thumbnail
dbo:wikiPageID
  • 60128175 (xsd:integer)
dbo:wikiPageLength
  • 3726 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1032029864 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In graph theory, a subfield of mathematics, a well-colored graph is an undirected graph for which greedy coloring uses the same number of colors regardless of the order in which colors are chosen for its vertices. That is, for these graphs, the chromatic number (minimum number of colors) and Grundy number (maximum number of greedily-chosen colors) are equal. (en)
rdfs:label
  • Well-colored graph (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
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