Equitable coloring of hypergraphs

DOI10.1016/j.dam.2019.01.016zbMath1410.05067OpenAlexW2913978787MaRDI QIDQ2414464

Paweł Obszarski, Hanna Furmańczyk

Publication date: 17 May 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.01.016

zbMATH Keywords

hypergraphequitable coloringfeasible sequencelinear hypertree

Mathematics Subject Classification ID

Hypergraphs (05C65) Dynamic programming (90C39) Coloring of graphs and hypergraphs (05C15)

Related Items

Concepts on coloring of cluster hypergraphs with application

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equitable colorings of non-uniform simple hypergraphs
• Equitable colorings of nonuniform hypergraphs
• Equitable two-colorings of uniform hypergraphs
• Bounded vertex colorings of graphs
• A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
• Linear hypertree for multi-dimensional image representation
• Some simplified NP-complete graph problems
• Equipartite colorings in graphs and hypergraphs
• Equitable coloring of trees
• Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
• Equitable Coloring
• Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling