Packing \(K_r\)s in bounded degree graphs
From MaRDI portal
Publication:6497939
DOI10.1016/J.DAM.2024.03.010MaRDI QIDQ6497939
Michael D. McKay, David F. Manlove
Publication date: 6 May 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
claw-free graphstriangle packingclique packingvertex-disjoint trianglesedge-disjoint triangles\(K_r\)-packing
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial and computational aspects of graph packing and graph decomposition
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Packings by cliques and by finite families of graphs
- On maximal independent sets of vertices in claw-free graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Automata, languages and programming. 26th international colloquium, ICALP `99. Prague, Czech Republic, July 11--15, 1999. Proceedings
- Matching and multidimensional matching in chordal and strongly chordal graphs
- Packing triangles in bounded degree graphs.
- On perfect packings in dense graphs
- Partition into triangles on bounded degree graphs
- Packing triangles in low degree graphs and indifference graphs
- On the Complexity of General Graph Factor Problems
- 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
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- On the Computational Complexity of Combinatorial Problems
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- Paths, Trees, and Flowers
- On the completeness of a generalized matching problem
- Approximation algorithms and hardness results for the clique packing problem
- The \(K_r\)-packing problem
This page was built for publication: Packing \(K_r\)s in bounded degree graphs
