当前位置:
X-MOL 学术
›
J. Graph Theory
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Order plus size of τ‐critical graphs
Journal of Graph Theory ( IF 0.9 ) Pub Date : 2020-06-26 , DOI: 10.1002/jgt.22603 András Gyárfás 1 , Jenő Lehel 1, 2
Journal of Graph Theory ( IF 0.9 ) Pub Date : 2020-06-26 , DOI: 10.1002/jgt.22603 András Gyárfás 1 , Jenő Lehel 1, 2
Affiliation
Let be a ‐critical graph with . Erdős and Gallai proved that and the bound was obtained by Erdős, Hajnal, and Moon. We give here the sharp combined bound and find all graphs with equality.
中文翻译:
阶图加上τ临界图的大小
让 成为 关键图 。Erdős和Gallai证明了 和界限 由Erdős,Hajnal和Moon获得。我们在这里给出了清晰的组合边界 并找到所有相等的图
更新日期:2020-06-26
中文翻译:
阶图加上τ临界图的大小
让 成为 关键图 。Erdős和Gallai证明了 和界限 由Erdős,Hajnal和Moon获得。我们在这里给出了清晰的组合边界 并找到所有相等的图