Edge Partition of Graphs Embeddable in the Projective Plane and the Klein Bottle
Received:September 22, 2019  Revised:October 10, 2019
Key Words: surface   planar graph   edge partition   thickness   outerthickness   caterpillar tree   projective plane   Klein bottle  
Fund Project:
Author NameAffiliation
Xiaoya ZHA Department of Mathematical Sciences, Middle Tennessee State University, Murfreesboro, TN 37132, U. S. A. 
Hits: 533
Download times: 387
      In a previous paper by the author joint with Baogang XU published in Discrete Math in 2018, we show that every non-planar toroidal graph can be edge partitioned into a planar graph and an outerplanar graph. This edge partition then implies some results in thickness and outerthickness of toroidal graphs. In particular, if each planar graph has outerthickness at most $2$ (conjectured by Chartrand, Geller and Hedetniemi in 1971 and the confirmation of the conjecture was announced by Gon\c{c}alves in 2005), then the outerthickness of toroidal graphs is at most 3 which is the best possible due to $K_7$. In this paper we continue to study the edge partition for projective planar graphs and Klein bottle embeddable graphs. We show that (1) every non-planar but projective planar graph can be edge partitioned into a planar graph and a union of caterpillar trees; and (2) every non-planar Klein bottle embeddable graph can be edge partitioned into a planar graph and a subgraph of two vertex amalgamation of a caterpillar tree with a cycle with pendant edges. As consequences, the thinkness of projective planar graphs and Klein bottle embeddabe graphs are at most $2$, which are the best possible, and the outerthickness of these graphs are at most $3$.
View Full Text  View/Add Comment  Download reader