Haven (graph Theory)

Haven (graph Theory)

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.

Read more about Haven (graph Theory):  Definition, Example, Pursuit-evasion, Connections To Treewidth, Separators, and Minors, In Infinite Graphs

Other articles related to "haven, graphs, havens":

Haven (graph Theory) - In Infinite Graphs
... If a graph G contains a ray,a semi-infinite simple path with a starting vertex but no ending vertex,then it has a havenof order 0 that is,a function that maps each finite set X of vertices to ... Namely,define X)to be the unique X-flap that contains infinitely many vertices of the ray ... Thus,in the case of infinite graphsthe connection between treewidth and havensbreaks down a single ray,despite itself being a tree,has havensof all finite orders and ...

Famous quotes containing the word haven:

    The dry eucalyptus seeks god in the rainy cloud.
    Professor Eucalyptus of New Haven seeks him
    In New Haven with an eye that does not look
    Beyond the object.
    Wallace Stevens (1879–1955)