On some open problems concerning quorum colorings of graphs

DOI10.1016/j.dam.2018.03.060zbMath1394.05036OpenAlexW2797281192WikidataQ130040407 ScholiaQ130040407MaRDI QIDQ1671350

Rafik Sahbi, Mustapha Chellali

Publication date: 6 September 2018

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

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

zbMATH Keywords

complexitydefensive alliancesquorum colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

New sharp lower bound for the quorum coloring number of trees ⋮ Alliances and Related Domination Parameters ⋮ On the complexity of some quorum colorings problems of graphs

Cites Work

• Quorum colorings of graphs
• The alliance partition number of grid graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On some open problems concerning quorum colorings of graphs