Combinatorics and Graph Theory


Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and K-Planar Graphs

Authors: Jiawei Gao, Ton Kloks, Sheung-Hung Poon

We show that there is a linear-time algorithm to partition the edges of a planar graph into triangles. We show that the problem is also polynomial for toroidal graphs but NP-complete for k-planar graphs, where k is at least 8.

Comments: 15 Pages.

Download: PDF

Submission history

[v1] 2012-09-17 05:15:21

Unique-IP document downloads: 606 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus