Some results on triangle partitions
Combinatorics
2011-04-21 v1
Abstract
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.
Cite
@article{arxiv.1104.3919,
title = {Some results on triangle partitions},
author = {Ton Kloks and Sheung-Hung Poon},
journal= {arXiv preprint arXiv:1104.3919},
year = {2011}
}