6 citations · 7 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2014
Boxicity and separation dimension
Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic +2
A family of permutations of the vertices of a hypergraph is called 'pairwise suitable' for if, for every pair of disjoint edges in , there exists a permuta…
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…