Search results for: LINEAR HYPERTREE - Bridge of Knowledge

Search results for: LINEAR HYPERTREE

results on page:
embed this view on your website

Found little results, maybe try searching with alternative method.

Filters

total: 1

clear all filters disabled

Equitable coloring of hypergraphs
Publication
- H. Furmańczyk
- P. Obszarski
- DISCRETE APPLIED MATHEMATICS - Year 2019
A hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...

Full text available to download