Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Perfectly_orderable_graph> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Perfectly_orderable_graph abstract "In graph theory, a perfectly orderable graph is a graph whose vertices can be ordered in such a way that a greedy coloring algorithm with that ordering optimally colors every induced subgraph of the given graph. Perfectly orderable graphs form a special case of the perfect graphs, and they include the chordal graphs, comparability graphs, and distance-hereditary graphs. However, testing whether a graph is perfectly orderable is NP-complete.".
- Perfectly_orderable_graph wikiPageID "21051205".
- Perfectly_orderable_graph wikiPageRevisionID "576585086".
- Perfectly_orderable_graph hasPhotoCollection Perfectly_orderable_graph.
- Perfectly_orderable_graph subject Category:Graph_coloring.
- Perfectly_orderable_graph subject Category:Perfect_graphs.
- Perfectly_orderable_graph comment "In graph theory, a perfectly orderable graph is a graph whose vertices can be ordered in such a way that a greedy coloring algorithm with that ordering optimally colors every induced subgraph of the given graph. Perfectly orderable graphs form a special case of the perfect graphs, and they include the chordal graphs, comparability graphs, and distance-hereditary graphs. However, testing whether a graph is perfectly orderable is NP-complete.".
- Perfectly_orderable_graph label "Perfectly orderable graph".
- Perfectly_orderable_graph sameAs m.0kvhwf3.
- Perfectly_orderable_graph sameAs Q17148818.
- Perfectly_orderable_graph sameAs Q17148818.
- Perfectly_orderable_graph wasDerivedFrom Perfectly_orderable_graph?oldid=576585086.
- Perfectly_orderable_graph isPrimaryTopicOf Perfectly_orderable_graph.