| Issue |
RAIRO-Oper. Res.
Volume 58, Number 4, July-August 2024
Graphs, Combinatorics, Algorithms and Optimization
|
|
|---|---|---|
| Page(s) | 3597 - 3606 | |
| DOI | https://doi.org/10.1051/ro/2023149 | |
| Published online | 02 September 2024 | |
- M.R. Cerioli and J.L. Szwarcfiter, Characterizing intersection graphs of substars of a star. ARS Combin. 79 (2006) 21–31. [MathSciNet] [Google Scholar]
- M.-S. Chang, L.-J. Hung, T. Kloks and S.-L. Peng, Block-graph width, in Theory and Applications of Models of Computation, 6th Annual Conference, TAMC, Changsha, China, May 18–22, 2009. Proceedings (2009) 150–157. [Google Scholar]
- M.-S. Chang, L.-J. Hung, T. Kloks and S.-L. Peng, Block-graph width. Theor. Comput. Sci. 412 (2011) 2496–2502. [CrossRef] [Google Scholar]
- F.E. Contreras-Mendoza and C. Hernández-Cruz, Minimal obstructions to (s,1)-polarity in cographs. Discrete Appl. Math. 281 (2020) 111–117. [CrossRef] [MathSciNet] [Google Scholar]
- D.G. Corneil, H. Lerchs and L. Stewart Burlingham, Complement reducible graphs. Discrete Appl. Math. 3 (1981) 163–174. [CrossRef] [MathSciNet] [Google Scholar]
- T. Ekim, P. Hell, J. Stacho and D. de Werra, Polarity of chordal graphs. Discrete Appl. Math. 156 (2008) 2469–2479. [CrossRef] [MathSciNet] [Google Scholar]
- T. Ekim, N.V.R. Mahadev and D. de Werra, Polar cographs. Discrete Appl. Math. 156 (2008) 1652–1660. [CrossRef] [MathSciNet] [Google Scholar]
- T. Ekim, N.V.R. Mahadev and D. de Werra, Corrigendum to “Polar cographs” [Discrete Appl. Math. 156 (2008) 1652–1660]. Discrete Appl. Math. 171 (2014) 158. [CrossRef] [MathSciNet] [Google Scholar]
- E.M. Eschen and X. Wang, Algorithms for unipolar and generalized split graphs. Discrete Appl. Math. 162 (2014) 195–201. [CrossRef] [MathSciNet] [Google Scholar]
- S. Foldes and P.L. Hammer, Split graphs, in Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La., 1977), Congressus Numerantium, No. XIX (1977) 311–315. [Google Scholar]
- M.C. Golumbic, Trivially perfect graphs. Discrete Math. 24 (1978) 105–107. [CrossRef] [MathSciNet] [Google Scholar]
- M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Vol. 57 of Annals of Discrete Mathematics, 2nd edition. Elsevier Science B.V., Amsterdam (2004). [Google Scholar]
- P.L. Hammer and B. Simeone, The splittance of a graph. Combinatorica 1 (1981) 275–284. [CrossRef] [MathSciNet] [Google Scholar]
- P. Hell, C. Hernández-Cruz and C.L. Sales, Minimal obstructions to 2-polar cographs. Discrete Appl. Math. 261 (2019) 219–228. [CrossRef] [MathSciNet] [Google Scholar]
- V.B. Le and H.N. de Ridder, Probe split graphs. Discrete Math. Theor. Comput. Sci. 9 (2007). DOI: 10.46298/dmtcs.401. [Google Scholar]
- V.B. Le and R. Nevries, Complexity and algorithms for recognizing polar and monopolar graphs. Theor. Comput. Sci. 528 (2014) 1–11. [CrossRef] [Google Scholar]
- V.B. Le and S.-L. Peng, On the complete width and edge clique cover problems, in Computing and Combinatorics, edited by D. Xu, D. Du and D. Du. Springer International Publishing, Cham (2015) 537–547. [Google Scholar]
- V.B. Le and S.-L. Peng, On the complete width and edge clique cover problems. J. Comb. Optim. 36 (2018) 532–548. [CrossRef] [MathSciNet] [Google Scholar]
- J. Orlin, Contentment in graph theory: covering graphs with cliques. Indagationes Mathematicae (Proceedings) 80 (1977) 406–424. [CrossRef] [Google Scholar]
- J.L. Szwarcfiter and F. Maffray, On two generalizations of split graphs, in Plenary Presentation at ProNEx Workshop on Combinatorics, Algorithms, and Applications, Ubatuba, Brazil, September 2003 (2003). [Google Scholar]
- R.I. Tyshkevich and A.A. Chernyak, Decompositions of graphs. Cybernet. Systems Anal. 21 (1985) 231–242. [CrossRef] [Google Scholar]
- J.-H. Yan, J.-J. Chen and G.J. Chang, Quasi-threshold graphs. Discrete Appl. Math. 69 (1996) 247–255. [CrossRef] [MathSciNet] [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.