Grinstead's conjecture is true for graphs with a small clique number

被引：3
|
作者：
Kashiwabara, Kenji
Sakuma, Tadashi
机构：
[1] Univ Tokyo, Grad Sch Arts & Sci, Dept Syst Sci, Meguro Ku, Tokyo 1538902, Japan
[2] Yamagata Univ, Fac Educ Art & Sci, Yamagata 9908560, Japan
来源：
DISCRETE MATHEMATICS | 2006年 / 306卷 / 19-20期
关键词：
circular partitionable graph; CGPW-graph; Grinstead's conjecture;
D O I：
10.1016/j.disc.2005.12.040
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We will show that Grinstead's Conjecture holds true if min(alpha(G), omega(G)) <= 8. In other words; a circular partitionable graph G satisfying min(alpha(G), omega(G))<= 8 is always a so-called "CGPW-graph". (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：2572 / 2581
页数：10
相关论文
共 50 条
  • [21] Mader's conjecture for graphs with small connectivity
    Hong, Yanmei
    Liu, Qinghai
    JOURNAL OF GRAPH THEORY, 2022, 101 (03) : 379 - 388
  • [22] Ohba's conjecture for graphs with independence number five
    Kostochka, Alexandr V.
    Stiebitz, Michael
    Woodall, Douglas R.
    DISCRETE MATHEMATICS, 2011, 311 (12) : 996 - 1005
  • [23] List-Coloring Claw-Free Graphs with Small Clique Number
    Louis Esperet
    András Gyárfás
    Frédéric Maffray
    Graphs and Combinatorics, 2014, 30 : 365 - 375
  • [24] List-Coloring Claw-Free Graphs with Small Clique Number
    Esperet, Louis
    Gyarfas, Andras
    Maffray, Frederic
    GRAPHS AND COMBINATORICS, 2014, 30 (02) : 365 - 375
  • [25] Maximizing the density of Kt's in graphs of bounded degree and clique number
    Kirsch, R.
    Radcliffe, A. J.
    DISCRETE MATHEMATICS, 2020, 343 (06)
  • [26] Ore's conjecture on color-critical graphs is almost true
    Kostochka, Alexandr
    Yancey, Matthew
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2014, 109 : 73 - 101
  • [27] On the structure of Dense graphs with bounded clique number
    Oberkampf, Heiner
    Schacht, Mathias
    COMBINATORICS PROBABILITY & COMPUTING, 2020, 29 (05): : 641 - 649
  • [28] On graphs with equal coprime index and clique number
    Patil, Chetan
    Khandekar, Nilesh
    Joshi, Vinayak
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2023, 20 (03) : 235 - 243
  • [29] Colouring perfect graphs with bounded clique number
    Chudnovsky, Maria
    Lagoutte, Aurelie
    Seymour, Paul
    Spirkl, Sophie
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 122 : 757 - 775
  • [30] A New Spectral Bound on the Clique Number of Graphs
    Bulo, Samuel Rota
    Pelillo, Marcello
    STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, 2010, 6218 : 680 - 689
12345