Chrome Extension
WeChat Mini Program
Use on ChatGLM

强4-连通图的可收缩边

Ning DONG,Fen-mei MO, Bi-nan CHEN

Journal of Guangxi Teachers Education University(Natural Science Edition)(2017)

Cited 0|Views0
No score
Abstract
该文主要研究强4—连通图G上的可去边的数目,证明了强4-连通图G的任何一个生成树T上至少有3条可收缩边.进一步证明了除了一个特殊图外强4-连通的任意最长圈C上至少有5条可收缩边.有例子表明该文的结果是最好可能的.
More
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined