works on
bisplit graphs 1chordal graphs 1computational complexity 1graph algorithms 1hamiltonian cycle 1np-completeness 1

From the 1 of 1 linked paper with an AI index.

collaborators

1 paper

cs.DM2026

Short Cycles Decide P-versus-NPC Status ofHamiltonicity on Bisplit Graphs

Mahendra Kumar R, Renjith P, Aadhavan S +1

The paper classifies the complexity of Hamiltonian cycle and path problems on bisplit graphs, showing polynomial-time solvability for chordal bisplit graphs and NP-completeness for…