Backbone coloring of planar graphs without special circles

  • Authors:

  • Yuehua Bu;Yulin Li

  • Affiliations:

  • -;-

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2011

Quantified Score

Hi-index 5.23

Visualization

Abstract

In this paper, we prove that if G is a connected planar graph that is C"6-free or C"7-free and without adjacent triangles, then there exists a spanning tree T of G such that @g"b(G,T)@?4.