Vertex coloring of comparability +ke and -ke graphs

被引：0
|
作者：
Takenaga, Yasuhiko [1 ]
Higashide, Kenichi [1 ]
机构：
[1] Univ Electrocommun, Chofu, Tokyo 182, Japan
来源：
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 2006年 / 4271卷
关键词：
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 条
  • [41] Local antimagic vertex coloring for generalized friendship graphs
    Nalliah, M.
    Shankar, R.
    Wang, Tao-Ming
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2023, 26 (04): : 1063 - 1078
  • [42] On the vertex distinguishing equitable edge-coloring of graphs
    Zhang, Zhong-fu
    Li, Mu-chun
    Yao, Bing
    Xu, Bo-gen
    Wang, Zhi-wen
    Li, Jing-wen
    ARS COMBINATORIA, 2008, 86 : 193 - 200
  • [43] On vertex-coloring edge-weighting of graphs
    Lu, Hongliang
    Yang, Xu
    Yu, Qinglin
    FRONTIERS OF MATHEMATICS IN CHINA, 2009, 4 (02) : 325 - 334
  • [44] D(β)-vertex-distinguishing total coloring of graphs
    Zhongfu Zhang
    Jingwen Li
    Xiang’en Chen
    Bing Yao
    Wenjie Wang
    Pengxiang Qiu
    Science in China Series A: Mathematics, 2006, 49 : 1430 - 1440
  • [45] Acyclic vertex coloring of graphs of maximum degree 5
    Yadav, Kishore
    Varagani, Satish
    Kothapalli, Kishore
    Venkaiah, V. Ch.
    DISCRETE MATHEMATICS, 2011, 311 (05) : 342 - 348
  • [46] Adjacent vertex distinguishing total coloring in split graphs
    Verma, Shaily
    Fu, Hung-Lin
    Panda, B. S.
    DISCRETE MATHEMATICS, 2022, 345 (11)
  • [47] Online vertex-coloring games in random graphs
    Martin Marciniszyn
    Reto Spöhel
    Combinatorica, 2010, 30 : 105 - 123
  • [48] The adjacent vertex distinguishing total coloring of planar graphs
    Weifan Wang
    Danjun Huang
    Journal of Combinatorial Optimization, 2014, 27 : 379 - 396
  • [49] D(β)-vertex-distinguishing total coloring of graphs
    ZHANG Zhongfu
    College of Mathematics and Information Science
    College of Information and Electrical Engineering
    ScienceinChina(SeriesA:Mathematics), 2006, (10) : 1430 - 1440
  • [50] VERTEX COLORING EDGE WEIGHTINGS OF SOME SQUARE GRAPHS
    Paramaguru, N.
    TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2021, 11 : 195 - 202
12345