Colin de Verdière graph invariant: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>David Eppstein
m →‎References: fix typos in params
 
en>Myuwmath
No edit summary
Line 1: Line 1:
Hi there. Let me begin by introducing the author, her name is Myrtle Cleary. One of the issues she loves most is to read comics and she'll be starting some thing else along with it. North Dakota is her beginning location but she will have to move 1 working day or another. For many years I've been working as a payroll clerk.<br><br>Here is my page: std home test; [http://premium.asslikethat.com/blog/9567 pop over to these guys],
In [[graph theory]], a branch of [[mathematics]], the '''Fraysseix–Rosenstiehl planarity criterion''' is a characterization of [[planar graph]]s based on the properties of the [[trémaux tree]]s, named after [[Hubert de Fraysseix]] and [[Pierre Rosenstiehl]]. It can be used in conjunction with a [[depth-first search]] algorithm to [[planarity testing|test whether a graph is planar]] in [[linear time]].
 
Considering any depth-first search of a [[Graph (mathematics)|graph]] ''G'', the [[graph theory|edges]]
encountered when discovering a [[vertex (graph theory)|vertex]] for the first time define a '''DFS-tree''' ''T'' of ''G''. The remaining edges form the '''cotree'''. Three types of patterns define two relations on the set of the cotree edges, namely the '''''T''-alike''' and '''''T''-opposite''' relations:
 
In the following figures, simple circle nodes represent vertices, double circle nodes represent subtrees. Twisted segments represent tree paths and curved arcs represent cotree edges (with label of the edge put near the curved arc). In the first figure, <math>\alpha</math> and <math>\beta</math> are ''T''-alike (it means that their low extremities will be on the same side of the tree in every planar drawing); in the next two figures, they are ''T''-opposite (it means that their low extremities will be on different sides of the tree in every planar drawing).
 
{| cellpadding="12"
|[[Image:leftright1.png|thumb|<math>\alpha</math> and <math>\beta</math> are T-alike]]||[[Image:leftright2.png|thumb|<math>\alpha</math> and <math>\beta</math> are T-opposite]]||[[Image:leftright3.png|thumb|<math>\alpha</math> and <math>\beta</math> are T-opposite]]
|}
 
:Let ''G'' be a graph and let ''T'' be a DFS-tree of ''G''. The graph ''G'' is planar if and only if there exists a partition of the cotree edges of ''G'' into two classes so that any two edges belong to a same class if they are ''T''-alike and any two edges belong to different classes if they are ''T''-opposite.
 
== References ==
* H. de Fraysseix and P. Rosenstiehl, ''A depth-first search characterization of planarity'', Annals of Discrete Mathematics '''13''' (1982), 75–80.
 
{{DEFAULTSORT:Fraysseix-Rosenstiehl planarity criterion}}
[[Category:Topological graph theory]]
[[Category:Planar graphs]]
 
 
{{Combin-stub}}

Revision as of 00:10, 5 January 2014

In graph theory, a branch of mathematics, the Fraysseix–Rosenstiehl planarity criterion is a characterization of planar graphs based on the properties of the trémaux trees, named after Hubert de Fraysseix and Pierre Rosenstiehl. It can be used in conjunction with a depth-first search algorithm to test whether a graph is planar in linear time.

Considering any depth-first search of a graph G, the edges encountered when discovering a vertex for the first time define a DFS-tree T of G. The remaining edges form the cotree. Three types of patterns define two relations on the set of the cotree edges, namely the T-alike and T-opposite relations:

In the following figures, simple circle nodes represent vertices, double circle nodes represent subtrees. Twisted segments represent tree paths and curved arcs represent cotree edges (with label of the edge put near the curved arc). In the first figure, and are T-alike (it means that their low extremities will be on the same side of the tree in every planar drawing); in the next two figures, they are T-opposite (it means that their low extremities will be on different sides of the tree in every planar drawing).

and are T-alike
and are T-opposite
and are T-opposite
Let G be a graph and let T be a DFS-tree of G. The graph G is planar if and only if there exists a partition of the cotree edges of G into two classes so that any two edges belong to a same class if they are T-alike and any two edges belong to different classes if they are T-opposite.

References

  • H. de Fraysseix and P. Rosenstiehl, A depth-first search characterization of planarity, Annals of Discrete Mathematics 13 (1982), 75–80.


Template:Combin-stub