Search Results

You are looking at 1 - 1 of 1 items for

  • Author or Editor: Anna Bachstein x
  • Refine by Access: All Content x
Clear All Modify Search
Mathematica Pannonica
Authors: Anna Bachstein, Wayne Goddard, and Michael A. Henning

The bipartite domination number of a graph is the minimum size of a dominating set that induces a bipartite subgraph. In this paper we initiate the study of this parameter, especially bounds involving the order, the ordinary domination number, and the chromatic number. For example, we show for an isolate-free graph that the bipartite domination number equals the domination number if the graph has maximum degree at most 3; and is at most half the order if the graph is regular, 4-colorable, or has maximum degree at most 5.

Open access