Pages that link to "Item:Q2476287"
From MaRDI portal
The following pages link to Packing triangles in low degree graphs and indifference graphs (Q2476287):
Displaying 17 items.
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- Packing and covering triangles in graphs (Q1296990) (← links)
- Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
- Using shortcut edges to maximize the number of triangles in graphs (Q1785441) (← links)
- Packing triangles in bounded degree graphs. (Q1853132) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Improved Approximation Algorithms for Weighted 2-Path Partitions (Q3452854) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- (Q4318220) (← links)
- MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS (Q5189989) (← links)
- Approximation algorithms and hardness results for the clique packing problem (Q5902134) (← links)
- A randomized approximation algorithm for metric triangle packing (Q5918266) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
- A polynomial time algorithm for the triangle packing problem on interval graphs (Q6140241) (← links)
- Packing \(K_r\)s in bounded degree graphs (Q6497939) (← links)
- A deterministic approximation algorithm for metric triangle packing (Q6589849) (← links)
- An improved approximation algorithm for metric triangle packing (Q6636067) (← links)