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 条
  • [21] Colorability of planar graphs with isolated nontriangular faces
    Ellingham, MN
    Fleischner, H
    Kochol, M
    Wenger, E
    GRAPHS AND COMBINATORICS, 2004, 20 (04) : 443 - 446
  • [22] GROWTH NUMBER AND COLORABILITY OF GRAPHS-2
    EHRENFEUCHT, A
    HURSCH, JL
    MORGENSTERN, C
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 23 (05): : A512 - A512
  • [23] Odd 4-edge-colorability of graphs
    Petrusevski, Mirko
    JOURNAL OF GRAPH THEORY, 2018, 87 (04) : 460 - 474
  • [24] ON EDGE-COLORABILITY OF CARTESIAN PRODUCTS OF GRAPHS
    MAHAMOODIAN, ES
    CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 1981, 24 (01): : 107 - 108
  • [25] On colorability of graphs with forbidden minors along paths and circuits
    Horev, Elad
    DISCRETE MATHEMATICS, 2011, 311 (8-9) : 699 - 704
  • [26] COVERINGS OF CUBIC GRAPHS AND 3-EDGE COLORABILITY
    Plachta, Leonid
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021, 41 (01) : 311 - 334
  • [27] 3-colorability εΡ for P6-free graphs
    Randerath, B
    Schiermeyer, I
    DISCRETE APPLIED MATHEMATICS, 2004, 136 (2-3) : 299 - 313
  • [28] A note on complex-4-colorability of signed planar graphs
    Kemnitz, Arnfried
    Voigt, Margit
    ELECTRONIC JOURNAL OF COMBINATORICS, 2021, 28 (02):
  • [29] DP-4-colorability of two classes of planar graphs
    Chen, Lily
    Liu, Runrun
    Yu, Gexin
    Zhao, Ren
    Zhou, Xiangqian
    DISCRETE MATHEMATICS, 2019, 342 (11) : 2984 - 2993
  • [30] A note on k-colorability of P-free graphs
    Hoang, Chinh T.
    Kaminski, Marcin
    Lozin, Vadim
    Sawada, Joe
    Shu, Xiao
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS, 2008, 5162 : 387 - +
12345