ON THE COLORABILITY OF M-COMPOSED GRAPHS

被引：0
|
作者：
KLEIN, R [1 ]
机构：
[1] TEL AVIV UNIV,SCH MATH SCI,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,IL-69978 TEL AVIV,ISRAEL
来源：
DISCRETE MATHEMATICS | 1994年 / 133卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(94)90025-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph is called m-degenerated if each of its subgraphs has minimum degree at most m. A graph, which is the union of an m-degenerated graph and an acyclic graph is called m-composed. Such a graph is (2m + 2)-colorable. Here it is conjectured that such a graph is nu = m + 1 + left-perpendicular (1 + square-root 8m + 1)/2 right-perpendicular-colorable. In support of this, wide classes of (nu + 1)-chromatic graphs are shown not to be m-composed. The conjecture for m = 2 is an open problem of Tarsi.
引用
收藏
页码：181 / 190
页数：10
相关论文
共 50 条
  • [31] EDGE-3-COLORABILITY OF CERTAIN GRAPHS .2.
    HURSCH, JL
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1975, 22 (05): : A537 - A537
  • [32] 3-colorability of 4-regular Hamiltonian graphs
    Fleischner, H
    Sabidussi, G
    JOURNAL OF GRAPH THEORY, 2003, 42 (02) : 125 - 140
  • [33] Improper colorability of planar graphs without prescribed short cycles
    Wang, Yingqian
    Xu, Jinghan
    DISCRETE MATHEMATICS, 2014, 322 : 5 - 14
  • [34] Colorability of Unitary Endo-Cayley Graphs of Cyclic Groups
    Promsakon, Chanon
    THAI JOURNAL OF MATHEMATICS, 2018, 16 (02): : 529 - 539
  • [35] The 3-colorability problem on graphs with maximum degree four
    Kochol, M
    Lozin, V
    Randerath, B
    SIAM JOURNAL ON COMPUTING, 2003, 32 (05) : 1128 - 1139
  • [36] Algorithms and Almost Tight Results for -Colorability of Small Diameter Graphs
    Mertzios, George B.
    Spirakis, Paul G.
    ALGORITHMICA, 2016, 74 (01) : 385 - 414
  • [37] Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs
    Bandeira, Afonso S.
    Banks, Jess
    Kunisky, Dmitriy
    Moore, Cristopher
    Wein, Alexander S.
    Proceedings of Machine Learning Research, 2021, 134 : 410 - 473
  • [38] Distance Constraints on Short Cycles for 3-Colorability of Planar graphs
    Kang, Yingli
    Wang, Yingqian
    GRAPHS AND COMBINATORICS, 2015, 31 (05) : 1497 - 1505
  • [39] Edge colorability of unitary endo-cayley graphs of cyclic groups
    Promsakon, C.
    Journal of Discrete Mathematical Sciences and Cryptography, 2018, 21 (01): : 191 - 198
  • [40] Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs
    Bandeira, Afonso S.
    Banks, Jess
    Kunisky, Dmitriy
    Moore, Cristopher
    Wein, Alexander S.
    CONFERENCE ON LEARNING THEORY, VOL 134, 2021, 134 : 410 - 473
12345