Open Access
Issue |
RAIRO-Oper. Res.
Volume 58, Number 3, May-June 2024
|
|
---|---|---|
Page(s) | 2631 - 2636 | |
DOI | https://doi.org/10.1051/ro/2024108 | |
Published online | 25 June 2024 |
- C. Benzaken and P.L. Hammer, Linear separation of dominating sets in graphs. Ann. Discrete Math. 3 (1978) 1–10. [CrossRef] [MathSciNet] [Google Scholar]
- N. Chiarelli and M. Milanič, On a class of graphs between threshold and total domishold graphs. Discrete Appl. Math. 195 (2015) 43–58. [CrossRef] [MathSciNet] [Google Scholar]
- V. Chvátal and P.L. Hammer, Aggregation of inequalities in integer programming. In Studies in Integer Programming, edited by P. Hammer, E. Johnson, B. Korte and G. Nemhauser. In Vol. 1 of Annals of Discrete Mathematics. Elsevier (1977) 145–162. [CrossRef] [Google Scholar]
- F. Gurski, Characterizations for co-graphs defined by restricted nlc-width or clique-width operations. Discrete Math. 306 (2006) 271–277. [CrossRef] [MathSciNet] [Google Scholar]
- T. Karthick and F. Maffray, Square-free graphs with no six-vertex induced path. SIAM J. Discrete Math. 33 (2019) 874–909. [CrossRef] [MathSciNet] [Google Scholar]
- D. Seinsche, On a property of the class of n-colorable graphs. J. Comb. Theory Ser. B 16 (1974) 191–193. [CrossRef] [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.