国家自然科学基金资助项目(10771062)
结合连通度、点度及围长等条件,给出了两类新的上可嵌入图,且前者条件中的界是不可达的,而后者条件中的界是最好的。
Combining with connected degree ,vertice degree and girth, two classes of new and upper embeddable graphs are put forward. However, the boundary of the former conditions does impossibly reach and the latter is the best one.
张启明,黄元秋.点度,围长与图的上可嵌入性[J].湖南工业大学学报,2007,21(6):26-30.