Equitable coloring of hypergraphs

A hypergraph is equitably k-colorable if its vertices can be partitioned into k sets/color classes in such a way that monochromatic edges are avoided and the number of vertices in any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-com...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2019-05, Vol.261, p.186-192
Hauptverfasser:	Furmańczyk, Hanna, Obszarski, Paweł
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Apexes Color Coloring Dynamic programming Equitable coloring Feasible sequence Graph theory Graphs Hypergraph Linear hypertree Polynomials
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!