Domination in Some Subclasses of Bipartite Graphs

DOI10.1007/978-3-319-14974-5_17zbMath1432.68366OpenAlexW2164675585MaRDI QIDQ5174961

B. S. Panda, Arti Pandey

Publication date: 19 February 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-14974-5_17

zbMATH Keywords

NP-completenessdominationgraph classesconvex bipartite graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Domination in some subclasses of bipartite graphs ⋮ Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs ⋮ Induced Matching in Some Subclasses of Bipartite Graphs ⋮ Maximum Edge Bicliques in Tree Convex Bipartite Graphs ⋮ Linear algorithms for red and blue domination in convex bipartite graphs

This page was built for publication: Domination in Some Subclasses of Bipartite Graphs