A polynomial time algorithm for the triangle packing problem on interval graphs
From MaRDI portal
Publication:6140241
DOI10.1016/j.dam.2023.10.022zbMath1529.05147OpenAlexW4388160640MaRDI QIDQ6140241
Publication date: 2 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.10.022
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
This page was built for publication: A polynomial time algorithm for the triangle packing problem on interval graphs