scientific article; zbMATH DE number 7204410

DOI10.4230/LIPIcs.MFCS.2017.76zbMath1445.05099MaRDI QIDQ5111293

Enric Cosme-Llópez, Damien Pous

Publication date: 26 May 2020

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

zbMATH Keywords

graph theoryuniversal algebraaxiomatisationgraph minors

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph minors (05C83) Free algebras (08B20) Algebraic structures (08A99)

Related Items (5)

Unnamed Item ⋮ Unnamed Item ⋮ The class of representable semilattice-ordered monoids is not a variety ⋮ Graph theory in Coq: minors, treewidth, and isomorphisms ⋮ Graphical Conjunctive Queries.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• A partial k-arboretum of graphs with bounded treewidth
• Conjunctive query containment revisited
• The equational theory of union-free algebras of relations
• The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
• Topology of series-parallel networks
• Normal forms for binary relations
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The complexity of homomorphism and constraint satisfaction problems seen from the other side
• Graph expressions and graph rewritings
• An algebraic theory of graph reduction
• Recognizable sets of graphs: equivalent definitions and closure properties
• Definability equals recognizability for graphs of bounded treewidth
• Equivalent definitions of recognizability for sets of graphs of bounded tree-width
• Algebraic automata and context-free sets

This page was built for publication: