Pages that link to "Item:Q2392247"
From MaRDI portal
The following pages link to Partition into triangles on bounded degree graphs (Q2392247):
Displayed 7 items.
- Scheduling with interjob communication on parallel processors (Q1631686) (← links)
- Geometric versions of the three-dimensional assignment problem under general norms (Q1751127) (← links)
- A complexity and approximation framework for the maximization scaffolding problem (Q2354768) (← links)
- The complexity of degree anonymization by graph contractions (Q2407102) (← links)
- Subexponential Time Algorithms for Finding Small Tree and Path Decompositions (Q3452781) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)