Pages that link to "Item:Q1853132"

The following pages link to Packing triangles in bounded degree graphs. (Q1853132):

Displaying 21 items.

• Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
• Hardness and approximation of traffic grooming (Q837166) (← links)
• Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
• Packing edge-disjoint cycles in graphs and the cyclomatic number (Q968414) (← links)
• Packing disjoint cycles over vertex cuts (Q973127) (← links)
• On packing shortest cycles in graphs (Q989491) (← links)
• On approximating four covering and packing problems (Q1021577) (← links)
• Restricted assignment scheduling with resource constraints (Q1713408) (← links)
• Towards optimal kernel for edge-disjoint triangle packing (Q2446590) (← links)
• Triangle strings: structures for augmentation of vertex-disjoint triangle sets (Q2448121) (← links)
• Packing triangles in low degree graphs and indifference graphs (Q2476287) (← links)
• Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps (Q2828236) (← links)
• AN IMPLICIT COVER PROBLEM IN WILD POPULATION STUDY (Q3560058) (← links)
• On Approximating an Implicit Cover Problem in Biology (Q3638443) (← links)
• (Q4691867) (← 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 (Q5900079) (← links)
• Approximation algorithms and hardness results for the clique packing problem (Q5902134) (← links)
• Packing \(K_r\)s in bounded degree graphs (Q6497939) (← links)
• On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes (Q6575414) (← links)
• Egalitarian roommate allocations: complexity and stability (Q6658303) (← links)