当前位置:
X-MOL 学术
›
J. Comb. Theory B
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
7-Connected graphs are 4-ordered
Journal of Combinatorial Theory Series B ( IF 1.4 ) Pub Date : 2019-07-11 , DOI: 10.1016/j.jctb.2019.07.002 Rose McCarty , Yan Wang , Xingxing Yu
中文翻译:
7个连通图为4阶
更新日期:2019-07-11
Journal of Combinatorial Theory Series B ( IF 1.4 ) Pub Date : 2019-07-11 , DOI: 10.1016/j.jctb.2019.07.002 Rose McCarty , Yan Wang , Xingxing Yu
A graph G is k-ordered if for any distinct vertices , it has a cycle through in order. Let denote the minimum integer so that every -connected graph is k-ordered. The first non-trivial case of determining is when , where the previously best known bounds are . We prove that in fact .
中文翻译:
7个连通图为4阶
如果对于任何不同的顶点,则图G是k阶的,它有一个循环 为了。让 表示最小整数,以便每个 连通图是k阶的。确定的第一个非平凡案例 那时候 ,以前最知名的范围是 。我们证明事实。