Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Perfectly_orderable_graph> ?p ?o }
Showing triples 1 to 48 of
48
with 100 triples 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 wikiPageLength "8659".
- Perfectly_orderable_graph wikiPageOutDegree "28".
- Perfectly_orderable_graph wikiPageRevisionID "632241212".
- Perfectly_orderable_graph wikiPageWikiLink Category:Graph_coloring.
- Perfectly_orderable_graph wikiPageWikiLink Category:Perfect_graphs.
- Perfectly_orderable_graph wikiPageWikiLink Chordal_graph.
- Perfectly_orderable_graph wikiPageWikiLink Comparability_graph.
- Perfectly_orderable_graph wikiPageWikiLink Cycle_graph.
- Perfectly_orderable_graph wikiPageWikiLink Dilworths_theorem.
- Perfectly_orderable_graph wikiPageWikiLink Discrete_Mathematics_(journal).
- Perfectly_orderable_graph wikiPageWikiLink Distance-hereditary_graph.
- Perfectly_orderable_graph wikiPageWikiLink Glossary_of_graph_theory.
- Perfectly_orderable_graph wikiPageWikiLink Graph_theory.
- Perfectly_orderable_graph wikiPageWikiLink Greedy_coloring.
- Perfectly_orderable_graph wikiPageWikiLink Induced_path.
- Perfectly_orderable_graph wikiPageWikiLink Induced_subgraph.
- Perfectly_orderable_graph wikiPageWikiLink Lexicographic_breadth-first_search.
- Perfectly_orderable_graph wikiPageWikiLink NP-complete.
- Perfectly_orderable_graph wikiPageWikiLink NP-completeness.
- Perfectly_orderable_graph wikiPageWikiLink Neighborhood_(graph_theory).
- Perfectly_orderable_graph wikiPageWikiLink Neighbourhood_(graph_theory).
- Perfectly_orderable_graph wikiPageWikiLink Order_(journal).
- Perfectly_orderable_graph wikiPageWikiLink Partially_ordered_set.
- Perfectly_orderable_graph wikiPageWikiLink Perfect_graph.
- Perfectly_orderable_graph wikiPageWikiLink Topological_ordering.
- Perfectly_orderable_graph wikiPageWikiLink Topological_sorting.
- Perfectly_orderable_graph wikiPageWikiLink Transitive_orientation.
- Perfectly_orderable_graph wikiPageWikiLinkText "Perfectly orderable graph".
- Perfectly_orderable_graph wikiPageWikiLinkText "perfectly orderable graph".
- Perfectly_orderable_graph wikiPageWikiLinkText "perfectly orderable".
- Perfectly_orderable_graph hasPhotoCollection Perfectly_orderable_graph.
- Perfectly_orderable_graph wikiPageUsesTemplate Template:Citation.
- Perfectly_orderable_graph wikiPageUsesTemplate Template:Harvtxt.
- Perfectly_orderable_graph wikiPageUsesTemplate Template:Reflist.
- Perfectly_orderable_graph subject Category:Graph_coloring.
- Perfectly_orderable_graph subject Category:Perfect_graphs.
- Perfectly_orderable_graph hypernym Graph.
- Perfectly_orderable_graph type Software.
- Perfectly_orderable_graph type Graph.
- 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=632241212.
- Perfectly_orderable_graph isPrimaryTopicOf Perfectly_orderable_graph.