...
首页> 外文期刊>Mathematical notes >New Upper Bounds for the Independence Numbers of Graphs with Vertices in {-1,0,1}~n and Their Applications to Problems of the Chromatic Numbers of Distance Graphs
【24h】

New Upper Bounds for the Independence Numbers of Graphs with Vertices in {-1,0,1}~n and Their Applications to Problems of the Chromatic Numbers of Distance Graphs

机译:{-1,0,1}〜n中具有顶点的图的独立数的新上界及其在距离图的色数问题中的应用

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

摘要

Upper bounds for the independence numbers in the graphs with vertices at {- 1,0,1}~n are improved. Their applications to problems of the chromatic numbers of distance graphs are studied.
机译:顶点为{-1,0,1}〜n的图中独立性数的上限得到改善。研究了它们在距离图色数问题上的应用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号