A Planarity Criterion for Graphs

Details A Planarity Criterion for Graphs A Planarity Criterion for Graphs

2012-03-05

arxiv.org/abs/1203.0996v3

Mathematics

Combinatorics

7 pages

Scientific paper

It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive idea that with planarity there should be a linear ordering of the edges of a cocycle such that in the two subgraphs remaining after the removal of these edges there can be no crossing of disjoint paths that join the vertices of these edges. The proof given in the paper of the right-to-left direction of the equivalence is based on Kuratowski's Theorem for planarity involving K_{3,3} and K_5, but the criterion itself does not mention K_{3,3} and K_5. Some other variants of the criterion are also shown necessary and sufficient for planarity.

Affiliated with

Also associated with

No associations

Rating

A Planarity Criterion for Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Planarity Criterion for Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Planarity Criterion for Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-133968