Vertex coloring of comparability +ke and -ke graphs

被引:0
|
作者
Takenaga, Yasuhiko [1 ]
Higashide, Kenichi [1 ]
机构
[1] Univ Electrocommun, Chofu, Tokyo 182, Japan
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
F + ke and T - ke graphs are classes of graphs close to graphs in a graph class T. They are the classes of graphs obtained by adding or deleting at most k edges from a graph in T. In this paper, we consider vertex coloring of comparability+ke and comparability-ke graphs. We show that for comparability+ke graphs, vertex coloring is solved in polynomial time for k = 1 and NP-complete for k >= 2. We also show that vertex coloring of comparability-1e graphs is solved in polynomial time.
引用
收藏
页码:102 / +
页数:2
相关论文
共 50 条
  • [21] Strong Vertex Coloring in Bipolar Fuzzy Graphs
    Mohamed, S. Yahya
    Subashini, N.
    COMMUNICATIONS IN MATHEMATICS AND APPLICATIONS, 2022, 13 (02): : 575 - 583
  • [22] Local antimagic vertex coloring of a Myceilski of graphs
    Sethukkarasi, A.
    Vidyanandini, S.
    Nayak, Soumya Ranjan
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2024, 27 (04): : 1389 - 1401
  • [23] On N-2-vertex coloring of graphs
    Akbari, S.
    Alipourfard, N.
    Jandaghi, P.
    Mirtaheri, M.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (01)
  • [24] Adjacent Vertex Distinguishing Coloring of Fuzzy Graphs
    Gong, Zengtai
    Zhang, Chen
    MATHEMATICS, 2023, 11 (10)
  • [25] ORIENTATION AND VERTEX-COLORING OF COMPLETE GRAPHS
    BLOOM, DM
    AMERICAN MATHEMATICAL MONTHLY, 1979, 86 (01): : 56 - 56
  • [26] Adjacent Vertex Reducible Edge Coloring for graphs
    Ding, Zhe
    Li, Jingwen
    Luo, Rong
    Zhang, Lijing
    IEEE Joint International Information Technology and Artificial Intelligence Conference (ITAIC), 2022, 2022-June : 1049 - 1053
  • [27] On local vertex irregular reflexive coloring of graphs
    Dafik
    Koesoemawati, D.J.
    Agustin, I.H.
    Kurniawati, E.Y.
    Nisviasari, R.
    Journal of Physics: Conference Series, 2022, 2157 (01):
  • [28] Vertex Distinguishing Total Coloring of Ladder Graphs
    Bao, Shitang
    Wang, Zhiwen
    Wen, Fei
    INFORMATION AND AUTOMATION, 2011, 86 : 118 - +
  • [29] Strong parity vertex coloring of plane graphs
    Kaiser, Tomas
    Rucky, Ondrej
    Stehlik, Matej
    Skrekovski, Riste
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2014, 16 (01): : 143 - 158
  • [30] VENETIC KE (AND)
    HAMP, EP
    GLOTTA-ZEITSCHRIFT FUR GRIECHISCHE UND LATEINISCHE SPRACHE, 1993, 71 (1-2): : 65 - 65