Some results on triangle partitions
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 C4-packing on bipartite permutation graphs and we show that C4-packing on bipartite graphs is NP-complete. We characterize the cobipartite graphs that have a triangle partition.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.