Packing triangles in bounded degree graphs

Authors:
Alberto Caprara;Romeo Rizzi
Affiliations:
DEIS, University of Bologna, Viale Risorgimento 2, I-40136 Bologna, Italy;BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, DK-8000 Aarhus C, Denmark
Venue:
Information Processing Letters
Year:
2002

Citing 7
Cited 8

On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems

SIAM Journal on Discrete Mathematics
Maximum bounded 3-dimensional matching is MAX SNP-complete

Information Processing Letters
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Genome Rearrangements and Sorting by Reversals

SIAM Journal on Computing
Packing Cycles and Cuts in Undirected Graphs

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms

Approximation algorithms and hardness results for the clique packing problem

Discrete Applied Mathematics
On approximating four covering and packing problems

Journal of Computer and System Sciences
On packing shortest cycles in graphs

Information Processing Letters
On Approximating an Implicit Cover Problem in Biology

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Hardness and approximation of traffic grooming

Theoretical Computer Science
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition

Computer Science Review
Approximate graph isomorphism

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Towards optimal kernel for edge-disjoint triangle packing

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider the two problems of finding the maximum number of node disjoint triangles and edge disjoint triangles in an undirected graph. We show that the first (respectively second) problem is polynomially solvable if the maximum degree of the input graph is at most 3 (respectively 4), whereas it is APX-hard for general graphs and NP-hard for planar graphs if the maximum degree is 4 (respectively 5) or more.