Backbone coloring of planar graphs without special circles

In this paper, we prove that if G is a connected planar graph that is C6-free or C7-free and without adjacent triangles, then there exists a spanning tree T of G such that χb(G,T)≤4.