On the number of minimal separators in graphs

DOI10.1002/jgt.22179zbMath1386.05093OpenAlexW2755298988MaRDI QIDQ4638650

Serge Gaspers, Simon MacKenzie

Publication date: 27 April 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22179

zbMATH Keywords

extremal combinatoricscombinatorial boundsenumeration algorithms

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

On the number of connected sets in bounded degree graphs ⋮ Finding a maximum minimal separator: graph classes and fixed-parameter tractability ⋮ On the hardness of inclusion-wise minimal separators enumeration ⋮ On \(H\)-topological intersection graphs ⋮ On the maximum weight minimal separator

This page was built for publication: On the number of minimal separators in graphs