As the size of data we obtain increases, the importance of algorithms and data structures for efficiently handling big data also increases. Succinct representations are representations of objects which are compressed as much as possible, while keeping the ability of accessing them quickly. Such representations have been proposed in the past two decades for strings and trees, but those for graphs were not well studied. In this article, we survey recent progress in succinct representations for some graph classes.