scientific article; zbMATH DE number 7471674

MaRDI QIDQ5028434

Mateus de Oliveira Oliveira

Publication date: 9 February 2022

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

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

zbMATH Keywords

algorithmic metatheoremsbidimensionalitygraph completionCMSO logic

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• On search, decision, and the efficiency of polynomial-time algorithms
• Chordal embeddings of planar graphs
• Diameter and treewidth in minor-closed graph families
• Graph minors. XIII: The disjoint paths problem
• Contraction obstructions for treewidth
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Query evaluation via tree-decompositions
• Definability equals recognizability for graphs of bounded treewidth
• Context-Free Graph Properties via Definable Decompositions
• Definability Equals Recognizability for $k$-Outerplanar Graphs

This page was built for publication: