1 citations · 2 across the 7 of their papers we have counts for
Showing 2017 · cs.DMShow all
2 papers · 2 filters
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…