The leafage of a chordal graph G is the minimum integer ℓ such that G can be realized as an
intersection graph of subtrees of a tree with ℓ leaves. We consider structural parameterization by
the leafage of classical ...
Krithika, R.; Malu, V. K. Kutty; Sharma, Roohani; TALE, PRAFULLKUMAR(Schloss Dagstuhl, 2023-12)
A bipartite graph is called a biclique if it is a complete bipartite graph and a biclique is called a balanced biclique if it has equal number of vertices in both parts of its bipartition. In this work, we initiate the ...