scientific article; zbMATH DE number 7327938

MaRDI QIDQ5856407

Martin Grohe, Mikołaj Bojańczyk, Michał Pilipczuk

Publication date: 26 March 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

recognizabilitycliquewidthlinear cliquewidthMSO, definability

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

Canonisation and Definability for Graphs of Bounded Rank Width

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
• Graphs of linear clique-width at most 3
• Factorization forests of finite height
• \(k\)-NLC graphs and polynomial algorithms
• Linear time solvable optimization problems on graphs of bounded clique-width
• Upper bounds to the clique width of graphs
• Linear rank-width and linear clique-width of trees
• Approximating clique-width and branch-width
• Rank-width and vertex-minors
• On the relationship between NLC-width and linear NLC-width
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The Height of Factorization Forests
• Definability equals recognizability for graphs of bounded treewidth

This page was built for publication: