No abstract

Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings or IC-planar graph for short. A proper total-kcoloring of a graph G is a mapping c : V (G) ∪ E(G) → {1, 2,. .. , k} such that any two adjacent elements in V (G) ∪ E(G) receive different colors. Let

No abstract

No abstract

No abstract