EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 59 (2025) RAIRO-Theor. Inf. Appl., 59 (2025) 15 References
Open Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 59, 2025
Article Number 15
Number of page(s) 11
DOI https://doi.org/10.1051/ita/2025018
Published online 29 October 2025
  1. S.M. Hedetniemi, S.T. Hedetniemi, R. Laskar and H.M. Mulder, Quorum colorings of graphs. AKCE Int. J. Graphs Comb. 10 (2013) 97–109. [Google Scholar]
  2. K. Ouazine, H. Slimani and A. Tari, Alliances in graphs: parameters, properties and applications – a survey. AKCE Int. J. Graphs Comb. 15 (2018) 115–154. [Google Scholar]
  3. R. Sahbi, Solutions to four open problems on quorum colorings of graphs. RAIRO Oper. Res. 55 (2294) 2385–2394. [Google Scholar]
  4. R. Sahbi, Y. Belkina and A. Bennadji, Sub-quorum colorins of some infinite families of caterpillars. Submitted in RAIRO: Theoretical Informatics and Applications (2023). [Google Scholar]
  5. K.H. Shafique, Partitioning a graph in alliances and its application to data clustering, Ph.D. Thesis, University of Central Florida (2004). [Google Scholar]
  6. L. Eroh and R. Gera, Alliance partition number in graphs. Ars Combinatoria 103 (2012) 519–529. [Google Scholar]
  7. H. Fernaua and J.A. Rodriguez-Velazquez, A survey on alliances and related parameters in graphs. Electron. J. Graph Theory Appl. 2 (2014) 70–86. [Google Scholar]
  8. G.H. Fricke, L.M. Lawson, T.W. Haynes, S.M. Hedetniemi and S.T. Hedetniemi, A note on defensive alliances in graphs. Bull. ICA 38 (2003) 37–41. [Google Scholar]
  9. T.W. Haynes and S.T. Hedetniemi, Alliances and related domination parameters, in Structures of Domination in Graphs, Vol. 66. Springer (2021) 47-77. [Google Scholar]
  10. T.W. Haynes and J.A. Lachniet, The alliance partition number of grid graphs. AKCE Int. J. Graphs Combin. 4 (2007) 51–59. [Google Scholar]
  11. S.M. Hedetniemi, S.T. Hedetniemi and P. Kristiansen, Alliances in graphs. J. Combin. Math. Combin. Comput. 48 (2004) 157–177. [Google Scholar]
  12. S.M. Hedetniemi, S.T. Hedetniemi and P. Kristiansen, Alliances in graphs. J. Combin. Math. Combin. Comput. 48 (2004) 157–177. [Google Scholar]
  13. I.G. Yero and J.A. Rodríguez-Velázquez, A survey on alliances in graphs: defensive alliances. Util. Math. 105 (2017) 141–172. [Google Scholar]
  14. I.G. Yero, S. Bermudo, J.A. Rodríguez-Velázquez and J.M. Sigarreta, Partitioning a graph into defensive k-alliances. Acta Math. Sin. (Engl. Ser.) 27 (2011) 73–82. [Google Scholar]
  15. R. Sahbi and M. Chellali, On some open problems concerning quorum colorings of graphs, Discrete Appl. Math. 247 (2018) 294–299. [Google Scholar]
  16. R. Sahbi, New sharp lower bound for the quorum coloring number of trees. Inf. Process. Lett. 178 (2022) 106297. [Google Scholar]
  17. R. Sahbi, On the complexity of some quorum colorings problems of graphs. AKCE Int. J. Graphs Comb. 17 (2020) 784–787. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.