<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06053930</id>
  <dt>j</dt>
  <an>06053930</an>
  <augroup>
    <au>Goddard, Wayne</au>
    <au>Lyle, Jeremy</au>
  </augroup>
  <ti>Independent dominating sets in triangle-free graphs.</ti>
  <so>J. Comb. Optim. 23, No. 1, 9-20 (2012).</so>
  <py>2012</py>
  <pu>Springer, Dordrecht</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>dominating sets</ut>
    <ut>independent domination</ut>
    <ut>triangle-free</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/s10878-010-9336-4</li>
  </ligroup>
  <abgroup>
    <ab>Summary: The independent domination number of a graph is the smallest cardinality of an independent set that dominates the graph. In this paper we consider the independent domination number of triangle-free graphs. We improve several of the known bounds as a function of the order and minimum degree, thereby answering conjectures of Haviland.</ab>
    <rv></rv>
  </abgroup>
</item>