Monadic second-order definable graph orderings
From MaRDI portal
Publication:2871227
DOI10.2168/LMCS-10(1:2)2014zbMath1315.03015arXiv1310.8148MaRDI QIDQ2871227
Publication date: 22 January 2014
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.8148
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Structural characterization of families of graphs (05C75) Decidability of theories and sets of sentences (03B25)
Related Items (3)
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity ⋮ Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees ⋮ Pathlength of outerplanar graphs
This page was built for publication: Monadic second-order definable graph orderings
