Minimal separators in graph classes defined by small forbidden induced subgraphs
From MaRDI portal
Publication:2301558
DOI10.1007/978-3-030-30786-8_29OpenAlexW2975195931MaRDI QIDQ2301558FDOQ2301558
Authors: Martin Milanič, Nevena Pivač 
Publication date: 24 February 2020
Full work available at URL: https://arxiv.org/abs/1903.04534
Recommendations
- scientific article; zbMATH DE number 4144031
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Minimal forbidden subgraphs of reducible graph properties
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs
- scientific article; zbMATH DE number 3961651
- On classes of graphs with strongly sublinear separators
- On forbidden subdivision characterizations of graph classes
- Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs
- On the number of minimal separators in graphs
- On the number of minimal separators in graphs
Cited In (6)
- Bisimplicial separators
- Forbidden minors to graphs with small feedback sets
- Minimal separators in graph classes defined by small forbidden induced subgraphs
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability
- Taming graphs with no large creatures and skinny ladders
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
This page was built for publication: Minimal separators in graph classes defined by small forbidden induced subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301558)
