Several notions of rank-width for countable graphs

DOI10.1016/j.jctb.2016.12.002zbMath1354.05038OpenAlexW2200685776MaRDI QIDQ505916

No author found.

Publication date: 26 January 2017

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2016.12.002

zbMATH Keywords

compactnesslinear rank-widthrank-widthKoenig's lemma

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Induced betweenness in order-theoretic trees ⋮ Order-theoretic Trees: Monadic Second-order Descriptions and Regularity ⋮ Betweenness in Order-Theoretic Trees ⋮ Unnamed Item ⋮ Regularity Equals Monadic Second-Order Definability for Quasi-trees ⋮ Betweenness of partial orders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
• Excluded vertex-minors for graphs of linear rank-width at most \(k\)
• Clique-width of countable graphs: A compactness property.
• Clique-sums, tree-decompositions and compactness
• The rank-width of edge-coloured graphs
• Faster algorithms for vertex partitioning problems parameterized by clique-width
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• Approximating clique-width and branch-width
• A model-theoretic characterisation of clique width
• Rank-width and vertex-minors
• Linear Rank-Width and Linear Clique-Width of Trees
• Thread Graphs, Linear Rank-Width and Their Algorithmic Applications

This page was built for publication: Several notions of rank-width for countable graphs