Bisplit graphs -- a structural and algorithmic study

DOI10.1016/J.DAM.2026.04.006MaRDI QIDQ7262710zbMATH OpenFDO

Authors Arusamy Mohanapriya, P. Renjith, N. Sadagopan

Publication date 12 June 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2026.04.006

zbMATH Keywords

bisplit graphsdomination and its variantsFPTSteiner tree problemW-hardness

Mathematics Subject Classification ID

Graph theory (05Cxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A Dirac-type characterization of \(k\)-chordal graphs
• A note on the recognition of bisplit graphs
• Bisplit graphs
• Bisplit graphs satisfy the Chen-Chvátal conjecture
• Clustering and domination in perfect graphs
• Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
• Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
• Complexity of total outer-connected domination problem in graphs
• Computing a minimum outer-connected dominating set for the class of chordal graphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• HAMILTONian circuits in chordal bipartite graphs
• Node-Deletion Problems on Bipartite Graphs
• On the complexity of the minimum outer-connected dominating set problem in graphs
• Quadratic vertex kernel for split vertex deletion
• Steiner trees, connected domination and strongly chordal graphs
• The node-deletion problem for hereditary properties is NP-complete
• The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
• The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy
• Vulnerability of super connected split graphs and bisplit graphs

This page was built for publication: Bisplit graphs -- a structural and algorithmic study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262710)