搜索结果: 1-2 共查到“运筹学 double”相关记录2条 . 查询时间(0.046 秒)
In the course of proving the strong perfect graph theorem, Chudnovsky, Robertson, Seymour,
and Thomas showed that every perfect graph either belongs to one of five basic classes or admits one of seve...
Circulant double coverings of a circulant graph of valency five
graph covering voltage assignment Cayley circulant graph
2007/12/11
Enumerating the isomorphism classes of several types of graph covering projections is one of the central research topics in enumerative topological graph theory. A covering of $G$ is called circulant ...