scientific article; zbMATH DE number 7204410

DOI10.4230/LIPICS.MFCS.2017.76zbMATH Open1445.05099MaRDI QIDQ5111293FDOQ5111293

Authors: Enric Cosme-Llópez, Damien Pous 

Publication date: 26 May 2020

Title of this publication is not available (Why is that?)

Recommendations

• Treewidth-two graphs as a free algebra
• A formal proof of the minor-exclusion property for treewidth-two graphs
• scientific article; zbMATH DE number 3875333
• A characterization of \(K_{2,4}\)-minor-free graphs
• GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH

zbMATH Keywords

graph theorygraph minorsuniversal algebraaxiomatisation

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)

Cites Work

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

Cited In (6)

• Graph theory in Coq: minors, treewidth, and isomorphisms
• Graphical Conjunctive Queries.
• Treewidth-two graphs as a free algebra
• On the positive calculus of relations with transitive closure
• A formal proof of the minor-exclusion property for treewidth-two graphs
• The class of representable semilattice-ordered monoids is not a variety

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111293)