On some open problems concerning quorum colorings of graphs

DOI10.1016/J.DAM.2018.03.060MaRDI QIDQ1671350zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• On the complexity of some quorum colorings problems of graphs
• Solutions to four open problems on quorum colorings of graphs
• Quorum colorings of graphs
• scientific article; zbMATH DE number 1052826
• On the complexity of the selective graph coloring problem in some special classes of graphs

Cites work

• Alliance partition number in graphs.
• scientific article; zbMATH DE number 1933255 (Why is no real title available?)
• scientific article; zbMATH DE number 944226 (Why is no real title available?)
• scientific article; zbMATH DE number 2104729 (Why is no real title available?)
• scientific article; zbMATH DE number 2104820 (Why is no real title available?)
• Quorum colorings of graphs
• The alliance partition number of grid graphs

Cited in

(7)

• New sharp lower bound for the quorum coloring number of trees
• Quorum colorings of graphs
• Alliances and Related Domination Parameters
• On the complexity of some quorum colorings problems of graphs
• Solutions to four open problems on quorum colorings of graphs
• Quorum colorings of perfect trees
• Quorum colorings of maximum cardinality in linear time for a subclass of perfect trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671350)