On the complexity of some quorum colorings problems of graphs

DOI10.1016/j.akcej.2019.12.010zbMath1468.05085OpenAlexW3048278072MaRDI QIDQ5012382

Rafik Sahbi

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2019.12.010

zbMATH Keywords

complexitydefensive alliancequorum coloringssatisfactory partitioncost-effective partition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) 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

Cites Work

• Unnamed Item
• Unnamed Item
• On some open problems concerning quorum colorings of graphs
• Quorum colorings of graphs
• The alliance partition number of grid graphs
• Partition into Triangles on Bounded Degree Graphs
• Computing and Combinatorics

This page was built for publication: On the complexity of some quorum colorings problems of graphs