Solutions to four open problems on quorum colorings of graphs

DOI10.1051/RO/2021116zbMath1476.05060OpenAlexW3187392232MaRDI QIDQ5158313

Rafik Sahbi

Publication date: 21 October 2021

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2021116

zbMATH Keywords

complexitydiameterdefensive alliancesgood characterizationsquorum colorings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

New sharp lower bound for the quorum coloring number of trees

This page was built for publication: Solutions to four open problems on quorum colorings of graphs