1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DM2017
On -free Chordal bipartite graphs
S Aadhavan, P Renjith, N Sadagopan
A bipartite graph is chordal bipartite if every cycle of length at least 6 has a chord in it. In this paper, we investigate the structure of -free chordal bipartite graphs and…
cs.DM2017★ 1 cited
Hamiltonian Path in Split Graphs- a Dichotomy
P. Renjith, N. Sadagopan
In this paper, we investigate Hamiltonian path problem in the context of split graphs, and produce a dichotomy result on the complexity of the problem. Our main result is a deep in…
cs.LO2017★ 1 cited
FO and MSO approach to Some Graph Problems: Approximation and Poly time Results
Kona Harshita, Sounaka Mishra, Renjith. P +1
The focus of this paper is two fold. Firstly, we present a logical approach to graph modification problems such as minimum node deletion, edge deletion, edge augmentation problems…