Some results on triangle partitions

Details Some results on triangle partitions Some results on triangle partitions

2011-04-20

arxiv.org/abs/1104.3919v1

Mathematics

Combinatorics

Scientific paper

We show that there exist efficient algorithms for the triangle packing problem in colored permutation graphs, complete multipartite graphs, distance-hereditary graphs, k-modular permutation graphs and complements of k-partite graphs (when k is fixed). We show that there is an efficient algorithm for C_4-packing on bipartite permutation graphs and we show that C_4-packing on bipartite graphs is NP-complete. We characterize the cobipartite graphs that have a triangle partition.

Affiliated with

Also associated with

No associations

Rating

Some results on triangle partitions 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 Some results on triangle partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some results on triangle partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-431777