Dominating induced matching in some subclasses of bipartite graphs

DOI10.1007/978-3-030-11509-8_12OpenAlexW2908718414MaRDI QIDQ5919635

Juhi Chaudhary, B. S. Panda

Publication date: 10 October 2019

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-11509-8_12

zbMATH Keywords

matchingNP-completenessgraph algorithmspolynomial time algorithmsdominating induced matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Solving problems on generalized convex graphs via mim-width ⋮ Solving problems on generalized convex graphs via mim-width ⋮ Dominating induced matching in some subclasses of bipartite graphs

This page was built for publication: Dominating induced matching in some subclasses of bipartite graphs