66 citations · 323 across the 55 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 1 cited
Avoidable Vertices and Edges in Graphs
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich +2
A vertex in a graph is simplicial if its neighborhood forms a clique. We consider three generalizations of the concept of simplicial vertices: avoidable vertices (also known as \te…
math.CO2019
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…