scientific article; zbMATH DE number 7204410

DOI10.4230/LIPICS.MFCS.2017.76MaRDI QIDQ5111293zbMATH OpenFDO

Authors Enric Cosme-Llópez, Damien Pous

Publication date 26 May 2020

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)

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

Cites work

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

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)