3 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DM2013★ 3 cited
Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width
Daniel Meister, Udi Rotics
In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in th…
math.CO2006★ 1 cited
Chain Graphs have Unbounded Readability
Martin Charles Golumbic, Uri N. Peled, Udi Rotics
A triangle-free graph is called read- when there exists a monotone Boolean formula whose variables are the vertices of and whose minterms are precisely the edges of…