4 citations · 18 across the 31 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DM2015
Dominating induced matchings in graphs containing no long claw
Alain Hertz, Vadim Lozin, Bernard Ries +2
An induced matching in a graph is dominating if every edge not in shares exactly one vertex with an edge in . The dominating induced matching problem (also known as…
cs.DM2015★ 3 cited
Well-quasi-ordering does not imply bounded clique-width
Vadim Lozin, Igor Razgon, Viktor Zamaraev
We present a hereditary class of graphs of unbounded clique-width which is well-quasi-ordered by the induced subgraph relation. This result provides a negative answer to the questi…
math.CO2015★ 4 cited
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
A. Atminas, R. Brignall, V. Lozin +1
We discover new hereditary classes of graphs that are minimal (with respect to set inclusion) of unbounded clique-width. The new examples include split permutation graphs and bicha…