Several notions of rank-width for countable graphs
type: Item
instance of: scholarly article
title: Several notions of rank-width for countable graphs
zbMATH Open document ID: 1354.05038
published in: Journal of Combinatorial Theory. Series B
publication date: 2017-01-26T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 6678527
zbMATH Keywords: rank-width
zbMATH Keywords: linear rank-width
zbMATH Keywords: compactness
zbMATH Keywords: Koenig's lemma
MaRDI profile type: Publication
full work available at URL: j.jctb.2016.12.002
OpenAlex ID: W2200685776
cites work: Linear Rank-Width and Linear Clique-Width of Trees
cites work: A model-theoretic characterisation of clique width
cites work: Clique-width of countable graphs: A compactness property.
cites work: The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
cites work: Q3077955
cites work: Q3577833
cites work: Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
cites work: Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
cites work: Excluded vertex-minors for graphs of linear rank-width at most \(k\)
cites work: The rank-width of edge-coloured graphs
cites work: Clique-sums, tree-decompositions and compactness
cites work: Rank-width and vertex-minors
cites work: Faster algorithms for vertex partitioning problems parameterized by clique-width
cites work: Approximating clique-width and branch-width
cites work: Q4749830
DOI: 10.1016/J.JCTB.2016.12.002
author: Bruno Courcelle
description: scientific article; zbMATH DE number 6678527