...
首页> 外文期刊>Discrete Applied Mathematics >On an extremal problem related to a theorem of Whitney
【24h】

On an extremal problem related to a theorem of Whitney

机译:关于与惠特尼定理有关的极值问题

获取原文
获取原文并翻译 | 示例
           

摘要

A well known theorem of Whitney states that for any graph G, kappa(G) <= kappa '(G) <= delta(G). For any set of positive integers a, b, c, a <= b <= c, we determine the least order and the least size among all graphs with kappa = a, kappa ' = b and 6 = c. We also show that there exist graphs of all orders greater than or equal to the least order among those graphs with kappa = a, kappa ' = b and delta = c. (c) 2006 Elsevier B.V. All rights reserved.
机译:惠特尼的一个众所周知的定理指出,对于任何图G,kappa(G)<= kappa'(G)<= delta(G)。对于任何一组正整数a,b,c,a <= b <= c,我们确定kappa = a,kappa'= b和6 = c的所有图中最小的顺序和最小的大小。我们还表明,在那些具有kappa = a,kappa'= b和delta = c的图中,存在所有阶数大于或等于最小阶的图。 (c)2006 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号