<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>03997842</id>
  <dt>j</dt>
  <an>03997842</an>
  <augroup>
    <au>Dymacek, W.M.</au>
  </augroup>
  <ti>Bipartite Steinhaus graphs.</ti>
  <so>Discrete Math. 59, 9-20 (1986).</so>
  <py>1986</py>
  <pu>Elsevier Science B.V. (North-Holland), Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Steinhaus triangle</ut>
    <ut>bipartite Steinhaus graphs</ut>
    <ut>saturated matching</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/0012-365X(86)90064-6</li>
  </ligroup>
  <abgroup>
    <ab>Let $A\sb{ij}$ be a binary triangle with base $a\sb{1j}$, $1\le j\le n$ such that $a\sb{ij}=a\sb{i-1,j-1}+a\sb{i-1,j}$ for $1<i\le n$. Such triangle is called a Steinhaus triangle. Considering a Steinhaus triangle as the upper triangle of a symmetric matrix with a zero diagonal, we obtain a Steinhaus graph. In this paper are presented two results concerning the bipartite Steinhaus graphs. At first the bipartite Steinhaus graph is characterised as a Steinhaus graph without triangles. The second result is that a Steinhaus bipartite graph with vertex partition $\vert X\vert \le \vert Y\vert$ has X-saturated matching.</ab>
    <rv>D.Niepel</rv>
  </abgroup>
</item>