Search results for: POLYNOMIAL TIME - Bridge of Knowledge

Your account

login

Search

Search results for: POLYNOMIAL TIME

Filters

total: 160
filtered: 151

clear all filters

Chosen catalog filters

  • Category

  • Year

  • Options

clear Chosen catalog filters disabled

Search results for: POLYNOMIAL TIME

  • Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs

    Publication

    - Year 2016

    In this paper we consider the complexity of semi-equitable k-coloring of the vertices of a cubic or subcubic graph. We show that, given n-vertex subcubic graph G, a semi-equitable k-coloring of G is NP-hard if s >= 7n/20 and polynomially solvable if s <= 7n/21, where s is the size of maximum color class of the coloring.

    Full text to download in external service