2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2020
A Note on Arc-Disjoint Cycles in Bipartite Tournaments
Jasine Babu, Ajay Saju Jacob, R. Krithika +1
We show that for each non-negative integer k, every bipartite tournament either contains k arc-disjoint cycles or has a feedback arc set of size at most 7(k - 1).
math.CO2012★ 2 cited
A Dirac-type Characterization of k-chordal Graphs
R. Krithika, Rogers Mathew, N. S. Narayanaswamy +1
Characterization of k-chordal graphs based on the existence of a "simplicial path" was shown in [Chv{á}tal et al. Note: Dirac-type characterizations of graphs without long chordles…