A polynomial time algorithm for the triangle packing problem on interval graphs

The triangle packing problem (TPP) is to find the maximum number of pairwise vertex disjoint triangles in a given graph. The TPP is NP-complete in a general graph and even so when a given graph is restricted to a chordal graph. On the other hand, the TPP can be solved in polynomial time for unit int...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 343; pp. 180 - 183
Main Author:	Myung, Young-Soo
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 30.01.2024
Subjects:	Interval graph Packing triangles Polynomial time algorithm Interval graph Packing triangles Polynomial time algorithm
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!