EDP Sciences logo
Subscriber Authentication Point
Sciengine logo
Search
Menu
All issues Volume 60 (2026) RAIRO-Theor. Inf. Appl., 60 (2026) 13 References
Open Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 60, 2026
Article Number 13
Number of page(s) 35
DOI https://doi.org/10.1051/ita/2026009
Published online 03 April 2026
  1. R. Fraïssé, Theory of relations. Studies in Logic, Vol. 145. North-Holland (2000). [Google Scholar]
  2. B. Courcelle and C. Delhommé, The modular decomposition of countable graphs. Definition and construction in monadic second-order logic. Theor. Comput. Sci. 394 (2008) 1–38. [Google Scholar]
  3. M. Bojanczyk, The category of MSO transductions (2023) arXiv:230518039. [Google Scholar]
  4. R. Campbell et al., CMSO-transducing tree-like graph Decompositions (2025) arXiv:2412.04970. [Google Scholar]
  5. B. Courcelle, The monadic second-order logic of graphs X: linear orderings. Theor. Comput. Sci. 160 (1996) 87–143. [Google Scholar]
  6. B. Courcelle, Several notions of rank-width for countable graphs. J. Comb. Theory B 123 (2017) 186–214. [Google Scholar]
  7. I. Kriz and R. Thomas, Clique-sums, tree-decompositions and compactness. Discret. Math. 81 (1990) 177–185. [Google Scholar]
  8. M. Changat, P. Narasimha-Shenoi and G. Seethakuttyamma, Betweenness in graphs: a short survey on shortest and induced path betweenness. AKCE Int. J. Graphs Combinat. 16 (2019) 96–109. [Google Scholar]
  9. V. Chvatal, Antimatroids, betweenness, convexity, in Research Trends in Combinatorial Optimization, Springer (2008) 57–64. [Google Scholar]
  10. B. Courcelle, Betweenness of partial orders. RAIRO Theor. Informatics Appl. 54 (2020) 7. [Google Scholar]
  11. B. Courcelle, Axiomatization of betweenness in order-theoretic trees. Log. Methods Comput. Sci. 17 (2021). [Google Scholar]
  12. A. Blumensath and B. Courcelle, Monadic second-order definable graph orderings. Log. Methods Comput. Sci. 10 (2014). [Google Scholar]
  13. T. Ganzow and S. Rubin, Order-invariant MSO is stronger than counting MSO in the finite, STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France. Proceedings LIPIcs 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany (2008) 313–324. [Google Scholar]
  14. B. Courcelle, Algebraic and logical descriptions of generalized trees. Log. Methods Comput. Sci. 13 (2017). [Google Scholar]
  15. B. Courcelle, Induced betweenness in order-theoretic trees. Discret. Math. Theor. Comput. Sci. 23 (2021). [Google Scholar]
  16. B. Courcelle, Fundamental properties of infinite Trees. Theor. Comput. Sci. 25 (1983) 95–169. [Google Scholar]
  17. B. Courcelle, The monadic second-order logic of graphs XVI: canonical graph decompositions. Log. Methods Comput. Sci. 2 (2006). [Google Scholar]
  18. The Z3 prover. https://www.microsoft.com/en-us/research/project/z3-3/. [Google Scholar]
  19. B. Courcelle and J. Engelfriet, Graph Structure and Monadic Second-order Logic, A Language Theoretic Approach. Cambridge University Press (2012). [Google Scholar]
  20. B. Courcelle, On first-order transductions of relational structures (2026) in preparation. [Google Scholar]
  21. W. Hodges, Model Theory. Cambridge University Press (1993). [Google Scholar]
  22. D. Kim and S. Oum, Vertex-minors of graphs: a survey. Discret. Appl. Math. 351 (2024) 54–73. [Google Scholar]
  23. B. Courcelle and S. Oum, Vertex-minors, monadic second-order logic, and a conjecture by Seese. J. Comb. Theory B 97 (2007) 91–126. [Google Scholar]
  24. B. Courcelle and I. Durand, Computations by fly-automata beyond monadic second-order logic. Theor. Comput. Sci. 619 (2016) 32–67. [Google Scholar]
  25. M. Bojanczyk, M. Grohe and M. Pilipczuk, Definable decompositions for graphs of bounded linear cliquewidth. Log. Methods Comput. Sci. 17 (2021) Paper No. 5. [Google Scholar]
  26. Y. Chen and J. Flum, Forbidden induced subgraphs and the Los-Tarski theorem. J. Symb. Log. 89 (2024) 516–548. [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.