| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10333897 | Theoretical Computer Science | 2011 | 5 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Yuehua Bu, Yulin Li,