8 citations · 12 across the 8 of their papers we have counts for
4 papers · 1 filter
A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor
Martin Milanič, Nevena Pivač
A minimal separator in a graph is an inclusion-minimal set of vertices that separates some fixed pair of nonadjacent vertices. A graph class is said to be tame if there exists a po…
Bisimplicial separators
Martin Milanič, Irena Penev, Nevena Pivač +1
A minimal separator of a graph is a set such that there exist vertices with the property that separates from in , b…
Computing Well-Covered Vector Spaces of Graphs using Modular Decomposition
Martin Milanič, Nevena Pivač
A graph is well-covered if all its maximal independent sets have the same cardinality. This well studied concept was introduced by Plummer in 1970 and naturally generalizes to the…
Minimal separators in graph classes defined by small forbidden induced subgraphs
Martin Milanič, Nevena Pivač
Minimal separators in graphs are an important concept in algorithmic graph theory. In particular, many problems that are NP-hard for general graphs are known to become polynomial-t…