Solutions to four open problems on quorum colorings of graphs

DOI10.1051/RO/2021116MaRDI QIDQ5158313zbMATH OpenOpenAlexFDO

Authors Rafik Sahbi

Publication date 21 October 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

complexitydefensive alliancesdiametergood characterizationsquorum colorings

Mathematics Subject Classification ID

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

Recommendations

• On some open problems concerning quorum colorings of graphs
• On the complexity of some quorum colorings problems of graphs
• Quorum colorings of graphs
• Minimax relations for the partial q-colorings of a graph
• Graph coloring with cardinality constraints on the neighborhoods

Cited in

(6)

• On some open problems concerning quorum colorings of graphs
• New sharp lower bound for the quorum coloring number of trees
• Quorum colorings of graphs
• On the complexity of some quorum colorings problems 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: Solutions to four open problems on quorum colorings of graphs

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