<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05999880</id>
  <dt>j</dt>
  <an>05999880</an>
  <augroup>
    <au>Zeng, Jianchu</au>
    <au>Liu, Yanpei</au>
    <au>Hao, Rongxia</au>
  </augroup>
  <ti>Counting orientable embeddings by genus for a type of 3-regular graph.</ti>
  <so>Graphs Comb. 28, No. 1, 133-142 (2012).</so>
  <py>2012</py>
  <pu>Springer-Verlag, Tokyo</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Surface</ut>
    <ut>Associate polyhegon</ut>
    <ut>Joint tree</ut>
    <ut>Genus</ut>
    <ut>Genus distribution</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/s00373-011-1029-y</li>
  </ligroup>
  <abgroup>
    <ab>Summary: On the basis of the joint tree model initiated in {\it Y. P. Liu} [``The non-orientable maximum genus of a graph", Sci. Sinica, Special Issue on Math. I 191-201 (1979)] and comprehensively described in {\it Y. P. Liu} [Theory of Polyhedra, Beijing: Science Press (2008)], this paper provides the numbers of topologically non-equivalent orientable embeddings of a new type of 3-regular graphs by genus via classifying the associate polyhegons.</ab>
    <rv></rv>
  </abgroup>
</item>