树
有标号
Trivial
Matrix67, 经典证明：Prüfer编码与Cayley公式
Wikipedia, Prüfer sequence
https://www.luogu.com.cn/problem/P5219 度限制
无标号
http://oeis.org/A000081
http://oeis.org/A000055
https://www.luogu.com.cn/problem/P5900
图
二分图
连通图
- POJ 1737. Connected Graph
- Project Euler 434. Rigid graphs
- Luogu P2767 树的数量
- Luogu P4841 [集训队作业2013]城市规划
基环树
- 有标号、基环树 http://oeis.org/A057500 | SGU 481
- Connected Functions，a.k.a. 可以有重边、自环 http://oeis.org/A001865 | https://www.cnblogs.com/dysyn1314/p/13436563.html
- 无标号 http://oeis.org/A001429
仙人掌
http://www.math.ucla.edu/~pak/hidden/papers/Moon-counting_labelled_trees.pdf
http://math.stackexchange.com/questions/689526/how-many-connected-graphs-over-v-vertices-and-e-edges
Level 1.
http://www.matrix67.com/blog/archives/682
http://www.spoj.com/problems/PT07D
https://www.shuizilong.com/house/archives/spoj-1480-let-us-count-1-2-3/
Level 2.
http://poj.org/problem?id=1737
Level 3.
http://www.spoj.com/problems/KPGRAPHS/
https://www.hackerrank.com/contests/infinitum-sep14/challenges/strongly-connected-digraphs
Other:
http://user.qzone.qq.com/251815992/blog/1380986878 (仙人掌图计数。。？？？)
https://projecteuler.net/problem=434
http://hihocoder.com/contest/challenge2/problems
http://hihocoder.com/discuss/question/591
“ 我十分有幸参加了这场500人斩比赛并贡献一WA ”。。
