2 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2009★ 2 cited
Chordal Bipartite Graphs with High Boxicity
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite grap…
math.CO2009
Boxicity of Leaf Powers
L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
The boxicity of a graph G, denoted as box(G) is defined as the minimum integer t such that G is an intersection graph of axis-parallel t-dimensional boxes. A graph G is a k-leaf po…