Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Haven_(graph_theory)> ?p ?o. }
Showing items 1 to 18 of
18
with 100 items per page.
- Haven_(graph_theory) abstract "In graph theory, a haven is a way of describing a strategy for an evader to win a certain type of pursuit-evasion game on an undirected graph. Havens were first introduced by Seymour & Thomas (1993); they may be used to characterize the treewidth of graphs, to prove the existence of small separators on minor-closed families of graphs, and to characterize the ends and clique minors of infinite graphs.".
- Haven_(graph_theory) wikiPageID "5133456".
- Haven_(graph_theory) wikiPageRevisionID "546890665".
- Haven_(graph_theory) hasPhotoCollection Haven_(graph_theory).
- Haven_(graph_theory) subject Category:Game_theory.
- Haven_(graph_theory) subject Category:Graph_minor_theory.
- Haven_(graph_theory) subject Category:Graph_theory_objects.
- Haven_(graph_theory) type GraphTheoryObjects.
- Haven_(graph_theory) type Object100002684.
- Haven_(graph_theory) type PhysicalEntity100001930.
- Haven_(graph_theory) comment "In graph theory, a haven is a way of describing a strategy for an evader to win a certain type of pursuit-evasion game on an undirected graph. Havens were first introduced by Seymour & Thomas (1993); they may be used to characterize the treewidth of graphs, to prove the existence of small separators on minor-closed families of graphs, and to characterize the ends and clique minors of infinite graphs.".
- Haven_(graph_theory) label "Haven (graph theory)".
- Haven_(graph_theory) sameAs m.0d48_w.
- Haven_(graph_theory) sameAs Q5683658.
- Haven_(graph_theory) sameAs Q5683658.
- Haven_(graph_theory) sameAs Haven_(graph_theory).
- Haven_(graph_theory) wasDerivedFrom Haven_(graph_theory)?oldid=546890665.
- Haven_(graph_theory) isPrimaryTopicOf Haven_(graph_theory).