<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05896634</id>
  <dt>j</dt>
  <an>05896634</an>
  <augroup>
    <au>Kainen, Paul C.</au>
  </augroup>
  <ti>Outerplanar crossing numbers of planar graphs.</ti>
  <so>Bull. Inst. Comb. Appl. 61, 69-76 (2011).</so>
  <py>2011</py>
  <pu>The Institute of Combinatorics and its Applications, Winnipeg</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>book crossing numbers</ut>
    <ut>convex crossing numbers</ut>
    <ut>path powers</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: The rate of increase of the outerplanar crossing number with number of vertices is studied for planar graphs. It is shown that second and third powers of paths behave, with respect to the outerplanar crossing number, as third and fourth powers do for planar crossings. For $r \ge 3$, the outerplanar crossing number of $\overline K_2 * C_r$ (the graph determined by a sphere with $r$ meridians, the equator, and north and south poles) is shown to be $2r - 4 + \lfloor r/2 \rfloor \lfloor (r-1)/2 \rfloor$, where ``$*$'' denotes graph-join.</ab>
    <rv></rv>
  </abgroup>
</item>