首页> 外文期刊>Graphs and Combinatorics >Linear Chromatic Bounds for a Subfamily of 3K 1-free Graphs
【24h】

Linear Chromatic Bounds for a Subfamily of 3K 1-free Graphs

机译:3K 1 无图的一个子族的线性色界

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

摘要

For an arbitrary class of graphs $mathcal{G}$ , there may not exist a function f such that $chi(G) leq f(omega(G))$ , for every $G in mathcal{G}$ . When such a function exists, it is called a χ-binding function for $mathcal{G}$ . The problem of finding an optimal χ-binding function for the class of 3K 1-free graphs is open. In this paper, we obtain linear χ-binding function for the class of {3K 1, H}-free graphs, where H is one of the following graphs: $K_1 + C_4, (K_3 cup K_1)+K_1, K_1 + P_4, K_4 cup K_1$ , House graph and Kite graph. We first describe structures of these graphs and then derive χ-binding functions.
机译:对于任意类别的图$ mathcal {G} $,可能不存在函数f,使得mathcal {G} $中的每个$ G都有$ chi(G)leq f(omega(G))$。当存在这样的函数时,称为$ mathcal {G} $的χ绑定函数。寻找无3K 1 图类的最优χ绑定函数的问题是存在的。在本文中,我们获得了无{3K 1 ,H}类图的线性χ绑定函数,其中H是以下图之一:$ K_1 + C_4,(K_3 cup K_1)+ K_1 ,K_1 + P_4,K_4杯子K_1 $,房屋图和风筝图。我们首先描述这些图的结构,然后得出χ绑定函数。

著录项

  • 来源
    《Graphs and Combinatorics》 |2008年第5期|413-428|共16页
  • 作者单位

    Department of Mathematics Indian Institute of Technology Madras Chennai 600 036 India;

    Department of Mathematics Indian Institute of Technology Madras Chennai 600 036 India;

    Department of Mathematics Birla Institute of Technology and Science Pilani Goa campus Goa 403 726 India;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Graphs; Chromatic number; Clique number; χ-binding function;

    机译:图;色数;类群数;χ-结合函数;
  • 入库时间 2022-08-18 01:49:06

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号