Domination in some subclasses of bipartite graphs

DOI10.1007/978-3-319-14974-5_17MaRDI QIDQ5174961zbMATH OpenOpenAlexFDO

Authors Arti Pandey, B. S. Panda

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

convex bipartite graphsdominationgraph classesNP-completeness

Mathematics Subject Classification ID

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

Recommendations

• Domination in some subclasses of bipartite graphs
• Domination in convex and chordal bipartite graphs
• Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs
• Dominating sets for split and bipartite graphs
• A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph

Cited in

(19)

• Domination parameters for the bishops graph
• Domination in some subclasses of bipartite graphs
• Greedy domination on biclique-free graphs
• Linear algorithms for red and blue domination in convex bipartite graphs
• Induced Matching in Some Subclasses of Bipartite Graphs
• Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
• scientific article; zbMATH DE number 4202309 (Why is no real title available?)
• scientific article; zbMATH DE number 5072535 (Why is no real title available?)
• Domination in Bipartite Graphs and in Their Complements
• Bipartite Domination and Simultaneous Matroid Covers
• Maximum Edge Bicliques in Tree Convex Bipartite Graphs
• Tractable connected domination for restricted bipartite graphs (extended abstract)
• scientific article; zbMATH DE number 5794154 (Why is no real title available?)
• Almost well-dominated bipartite graphs with minimum degree at least two
• Dominating Bipartite Subgraphs in Graphs
• Approximation hardness of domination problems on generalized convex graphs
• Dominating sets for split and bipartite graphs
• Domination in convex and chordal bipartite graphs
• Finding a dominating set on bipartite graphs

This page was built for publication: Domination in some subclasses of bipartite graphs

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