<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>00147137</id>
  <dt>j</dt>
  <an>00147137</an>
  <augroup>
    <au>Sampathkumar, E.</au>
  </augroup>
  <ti>A generalization of Menger's theorem for certain unicyclic graphs.</ti>
  <so>Graphs Comb. 8, No.4, 377-380 (1992).</so>
  <py>1992</py>
  <pu>Springer-Verlag, Tokyo</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Menger's theorem</ut>
    <ut>unicyclic graph</ut>
    <ut>independent set</ut>
    <ut>disjoint paths</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/BF02351593</li>
  </ligroup>
  <abgroup>
    <ab>Author's abstract: Let $G$ be a unicyclic graph such that at most two points on its cycle have degrees $\ge 3$. Then the minimum number of points separating any independent set $S$ of points in $G$ is the maximum number of disjoint paths between the points of $S$.</ab>
    <rv>B.Andr\'asfai (Budapest)</rv>
  </abgroup>
</item>