Regularity Equals Monadic Second-Order Definability for Quasi-trees (Q2947169): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3086920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width of countable graphs: A compactness property. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Several notions of rank-width for countable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Equals Monadic Second-Order Definability for Quasi-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modular decomposition of countable graphs. Definition and construction in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3871942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-sums, tree-decompositions and compactness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On frontiers of regular trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank

Latest revision as of 18:49, 10 July 2024

scientific article
Language Label Description Also known as
English
Regularity Equals Monadic Second-Order Definability for Quasi-trees
scientific article

    Statements

    Identifiers