Pages that link to "Item:Q3088032"
From MaRDI portal
The following pages link to The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree (Q3088032):
Displaying 4 items.
- Block interpolation: a framework for tight exponential-time counting complexity (Q1640999) (← links)
- An algorithm of polynomial order for computing the covering dimension of a finite space (Q1644532) (← links)
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724) (← links)
- (Q4016827) (← links)