Graphs with polynomially many minimal separators

  title={Graphs with polynomially many minimal separators},
  author={Tara Abrishami and M. Chudnovsky and Cemil Dibek and St'ephan Thomass'e and Nicolas Trotignon and Kristina Vuvskovi'c},
  journal={J. Comb. Theory, Ser. B},

Figures from this paper

Taming graphs with no large creatures and skinny ladders

We confirm a conjecture of Gartland and Lokshtanov [arXiv:2007.08761]: if for a hereditary graph class G there exists a constant k such that no member of G contains a k -creature as an induced

Disconnected Matchings

This paper considers the generalized problem of finding c-disconnected matchings; such matchings are ones whose vertex sets induce subgraphs with at least c connected components and shows how to obtain a maximum connected matching in linear time given an arbitrary maximum matching in the input.

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument

The Gyárfás’ path argument ensures that given an n -vertex P t -free graph, in polynomial time the authors can find a set P of at most t − 1 vertices, such that every connected component of G − N [ P ] has at most n/ 2 vertices.

Dominated Minimal Separators are Tame (Nearly All Others are Feral)

A complete classification of all hereditary graph classes defined by a finite set of forbidden induced subgraphs into strongly quasi-tame or feral is obtained.



Listing all potential maximal cliques of a graph

Treewidth and Minimum Fill-in: Grouping the Minimal Separators

It is shown that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum fill-in are polynomially tractable for these graphs.

Stable sets and graphs with no even holes

We develop decomposition/composition tools for efficiently solving maximum weight stable sets problems as well as for describing them as polynomially sized linear programs (using “compact systems”).

Independent Set in P5-Free Graphs in Polynomial Time

This paper gives the first polynomial time algorithm for Independent Set on P5-free graphs, and this algorithm also works for the Weighted Independent Set problem.

Finding Induced Subgraphs via Minimal Triangulations

It is shown that given an n-vertex graph G together with its set of potential maximal cliques, and an integer t, it is possible in time the number of potentialmaximal cliques times O(n^{O(t)}) to find a maximum induced subgraph of treewidth t in G and for a given graph F to decide if G contains an induced sub graph isomorphic to F.

Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs

A polynomial-time algorithm working on any $P_6$-free graph, that is, a graph that has no path on $6$ vertices as an induced subgraph is given.

Generating All the Minimal Separators of a Graph

We present an efficient algorithm which computes the set of minimal separators of a graph in O(n3) time per separator, thus gaining a factor of n2 on the current best-time algorithms for this

Induced subgraphs of bounded treewidth and the container method

It is shown that, given an $n-vertex graph G, one can in time find a maximum-weight induced subgraph of $G$ of treewidth less than k, which implies both aforementioned results.

Maximum independent sets in (pyramid, even hole)-free graphs

A polynomial time algorithm is given to compute a maximum weighted independent set in a even-hole-free graph that contains no pyramid as an induced subgraph based on the decomposition theorem and on bounding the number of minimal separators.

An Introduction to Clique Minimal Separator Decomposition

This paper is a review which presents and explains the decomposition of graphs by clique minimal separators, and provides easy algorithms to implement this decomposition.