▎ 摘　　要

A graphene fragment is a benzenoid graph that its dualist graph is a unicyclic graph. In particular, when the dualist graph of a benzenoid graph is a circle, it is called cyclofusene. In this paper, we determine the Clar number of a cyclofusene graph, and prove a bound for the Clar number of the graphene fragment. Moreover, we construct the graphene fragment which can attain this bound. More precisely, it is shown that the Clar number of the graphene fragment with n hexagons is at most [2n/3].