Induced betweenness in order-theoretic trees

DOI10.46298/dmtcs.7288OpenAlexW3196315390MaRDI QIDQ5038203

Bruno Courcelle

Publication date: 30 September 2022

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.15357

zbMATH Keywords

monadic second-order logicbetweennessinfinite treesexcluded induced subgraphsprobe cographs

Mathematics Subject Classification ID

Trees (05C05) Ordered sets (06A99) Infinite graphs (05C63) Higher-order logic (03B16)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Several notions of rank-width for countable graphs
• The behavior of clique-width under graph operations and graph transformations
• Well-quasi-order of relabel functions
• The monadic second-order logic of graphs. X: Linear orderings
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• Betweenness in graphs: a short survey on shortest and induced path betweenness
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• A SAT Approach to Clique-Width
• Characterisations and Linear-Time Recognition of Probe Cographs
• Betweenness of partial orders
• Betweenness in Order-Theoretic Trees
• Trees, Lattices, Order, and Betweenness
• Medians and Betweenness
• Transitivities of Betweenness

This page was built for publication: Induced betweenness in order-theoretic trees