Packing triangles in low degree graphs and indifference graphs

MaRDI QIDQ3576699zbMATH OpenFDO

Authors Gordana Manić, Yoshiko Wakabayashi

Publication date 30 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0150/0.html

zbMATH Keywords

approximation algorithmedge disjoint trianglesindifference graphlow degree graphpolynomial algorithmtriangle packingvertex disjoint triangles

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Packing triangles in low degree graphs and indifference graphs
• Packing triangles in bounded degree graphs.
• scientific article; zbMATH DE number 1262785
• Partition into triangles on bounded degree graphs
• Algorithms – ESA 2004

Cited in

(13)

• Triangle packings and 1-factors in oriented graphs
• Packing and covering triangles in graphs
• Using shortcut edges to maximize the number of triangles in graphs
• Packing triangles in bounded degree graphs.
• Packing triangles in low degree graphs and indifference graphs
• Independent packings in structured graphs
• Cycle transversals in bounded degree graphs
• Partition into triangles on bounded degree graphs
• scientific article; zbMATH DE number 1262785 (Why is no real title available?)
• scientific article; zbMATH DE number 706830 (Why is no real title available?)
• Approximation algorithms and hardness results for the clique packing problem
• A polynomial time algorithm for the triangle packing problem on interval graphs
• Packing and covering triangles in planar graphs

This page was built for publication: Packing triangles in low degree graphs and indifference graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576699)