2 papers
cs.DM2026
Short Cycles Decide P-versus-NPC Status ofHamiltonicity on Bisplit Graphs
Mahendra Kumar R, Renjith P, Aadhavan S +1
A connected graph G is said to be a bisplit graph if the vertex set of G can be partitioned into a stable set and a complete bipartite graph. We establish the following dichotomy w…
cs.DM2021
Hamiltonicity: Variants and Generalization in -free Chordal Bipartite graphs
S. Aadhavan, R. Mahendra Kumar, P. Renjith +1
A bipartite graph is chordal bipartite if every cycle of length at least six has a chord in it. Mller \cite {muller1996Hamiltonian} has shown that the Hamiltonian cyc…