On the number of minimal separators in graphs
From MaRDI portal
(Redirected from Publication:4638650)
On the number of minimal separators in graphs (scientific article; zbMATH DE number 6865397)
On the number of minimal separators in graphs (scientific article; zbMATH DE number 6865397)
Recommendations
Cited in
(19)- Efficient enumeration of all minimal separators in a graph
- Listing all potential maximal cliques of a graph
- On the number of connected sets in bounded degree graphs
- Minimal separators in extended \(P_4\)-laden graphs
- On the number of edges of separated multigraphs
- Minimal separators in graph classes defined by small forbidden induced subgraphs
- On the maximum weight minimal separator
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability
- Graphs with polynomially many minimal separators
- On the number of minimal separators in graphs
- Minimal separators in P₄-tidy graphs
- scientific article; zbMATH DE number 1305094 (Why is no real title available?)
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- On \(H\)-topological intersection graphs
- On the hardness of inclusion-wise minimal separators enumeration
- A safeness condition for minimal separators based on vertex connectivity
- Exploring the closure operator for minimal a, b-separators: insights from Galois connections
- Minimal separators in \(P_4\)-sparse graphs
This page was built for publication: On the number of minimal separators in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638650)