The $r$-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
From MaRDI portal
Publication:6383500
DOI10.1016/J.DISC.2023.113342zbMath1508.05064arXiv2111.10393MaRDI QIDQ6383500
Publication date: 19 November 2021
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: The $r$-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size