12 citations · 55 across the 33 of their papers we have counts for
6 papers · 1 filter
Separation dimension of bounded degree graphs
Noga Alon, Manu Basavaraju, L. Sunil Chandran +2
The 'separation dimension' of a graph is the smallest natural number for which the vertices of can be embedded in such that any pair of disjoint edges in…
Domination in designs
Felix Goldberg, Deepak Rajendraprasad, Rogers Mathew
We commence the study of domination in the incidence graphs of combinatorial designs. Let be a combinatorial design and denote by the domination number of the incidence…
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
The boxicity (respectively cubicity) of a graph is the minimum non-negative integer , such that can be represented as an intersection graph of axis-parallel -dimensio…
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…
Separation dimension of sparse graphs
Manu Basavaraju, L. Sunil Chandran, Rogers Mathew +1
The separation dimension of a graph is the smallest natural number for which the vertices of can be embedded in such that any pair of disjoint edges in $…
Partial list colouring of certain graphs
Jeannette Janssen, Rogers Mathew, Deepak Rajendraprasad
Let be a graph on vertices and let be an arbitrary function that assigns each vertex in a list of colours. Then is -list colourab…