Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract)

DOI10.1007/978-3-642-38768-5_65zbMath1382.68118OpenAlexW165018185MaRDI QIDQ4925288

Zhao Lu, Ke Xu, Tian Liu

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_65

zbMATH Keywords

polynomial timeconvex bipartite graphconnected dominationcircular-convex bipartite graphtriad-convex bipartite graph

Mathematics Subject Classification ID

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

Related Items (5)

Circular convex bipartite graphs: feedback vertex sets ⋮ Induced Matching in Some Subclasses of Bipartite Graphs ⋮ Maximum Edge Bicliques in Tree Convex Bipartite Graphs ⋮ Circular Convex Bipartite Graphs: Feedback Vertex Set ⋮ Tractable connected domination for restricted bipartite graphs

This page was built for publication: Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract)