Bipartite domination in graphs: complexity and algorithms

DOI10.1007/978-3-031-83438-7_20MaRDI QIDQ6969490zbMATH OpenFDO

Authors B. S. Panda, Subhasmita Joshi, Dalu Jacob

Publication date 20 June 2025

zbMATH Keywords

dominationblock graphsblock-cut treebipartite domination

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

This page was built for publication: Bipartite domination in graphs: complexity and algorithms

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