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

Full work available at URL https://doi.org/10.1007/978-3-031-83438-7_20

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)

Cites work

• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• Bipartite Domination in Graphs
• Dominating sets for split and bipartite graphs
• Independent domination in graphs: A survey and recent results
• The Lower Bipartite Number of a Graph
• The node-deletion problem for hereditary properties is NP-complete
• Topics in Domination in Graphs
• Total domination in graphs

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)