The largest demigenus of a bipartite signed graph

Thomas Zaslavsky
<span title="">2001</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
A graph with signed edges is orientation embedded in a surface when it is topologically embedded so that one trip around a closed path preserves or reverses orientation according as the path's sign product is positive or negative. We ÿnd the smallest surface within which it is possible to orientation-embed the complete bipartite signed graph ±Kr;s, which is obtained from the complete bipartite graph Kr;s through replacing each edge by two parallel edges, one positive and the other negative. We discuss some consequences and related problems.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1016/s0012-365x(00)00349-6</a> <a target="_blank" rel="external noopener" href="">fatcat:rlrg7wqfhvafhgmrvvbbmjntaq</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>