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 条
  • [41] Edge colorability of unitary endo-cayley graphs of cyclic groups
    Promsakon, C.
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2018, 21 (01): : 191 - 198
  • [42] Distance Constraints on Short Cycles for 3-Colorability of Planar graphs
    Yingli Kang
    Yingqian Wang
    Graphs and Combinatorics, 2015, 31 : 1497 - 1505
  • [43] On 3-colorability of planar graphs without adjacent short cycles
    WANG YingQian 1
    2 College of Basic Science
    ScienceChina(Mathematics), 2010, 53 (04) : 1129 - 1132
  • [44] On 3-colorability of planar graphs without adjacent short cycles
    Wang YingQian
    Mao XiangHua
    Lu, HuaJing
    Wang WeiFan
    SCIENCE CHINA-MATHEMATICS, 2010, 53 (04) : 1129 - 1132
  • [45] On 3-colorability of planar graphs without adjacent short cycles
    YingQian Wang
    XiangHua Mao
    HuaJing Lu
    WeiFan Wang
    Science China Mathematics, 2010, 53 : 1129 - 1132
  • [46] On Module-Composed Graphs
    Gurski, Frank
    Wanke, Egon
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2010, 5911 : 166 - 177
  • [47] Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs
    Mertzios, George B.
    Spirakis, Paul G.
    SOFSEM 2013: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2013, 7741 : 332 - 343
  • [48] (3a : a)-LIST-COLORABILITY OF EMBEDDED GRAPHS OF GIRTH AT LEAST FIVE
    Dvorak, Zdenek
    Hu, Xiaolan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (04) : 2137 - 2165
  • [49] A lower bound for testing 3-colorability in bounded-degree graphs
    Bogdanov, A
    Obata, K
    Trevisan, L
    FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 93 - 102
  • [50] A Certifying Algorithm for 3-Colorability of P5-Free Graphs
    Bruce, Daniel
    Hoang, Chinh T.
    Sawada, Joe
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 594 - +
12345