37 citations · 52 across the 9 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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…
math.CO2013★ 4 cited
On edge-sets of bicliques in graphs
Marina Groshaus, Pavol Hell, Juraj Stacho
A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the a…