Coloring clique-hypergraphs of graphs with no subdivision of K5

被引:0
|
作者
Shan, Erfang [1 ,2 ]
Kang, Liying [2 ]
机构
[1] School of Management, Shanghai University, Shanghai,200444, China
[2] Department of Mathematics, Shanghai University, Shanghai,200444, China
基金
中国国家自然科学基金;
关键词
Chromatic number - Free graphs - Hyperedges - Hypergraph - Maximal clique - Odd cycle - Planar graph - Polynomial-time algorithms;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:166 / 175
相关论文
共 50 条
  • [1] Coloring clique-hypergraphs of graphs with no subdivision of K5
    Shan, Erfang
    Kang, Liying
    THEORETICAL COMPUTER SCIENCE, 2015, 592 : 166 - 175
  • [2] List-coloring clique-hypergraphs of K5-minor-free graphs strongly
    Liang, Zuosong
    Wu, Jianliang
    Shan, Erfang
    DISCRETE MATHEMATICS, 2020, 343 (04)
  • [3] Colouring Clique-Hypergraphs of Circulant Graphs
    Campos, C. N.
    Dantas, S.
    de Mello, C. P.
    GRAPHS AND COMBINATORICS, 2013, 29 (06) : 1713 - 1720
  • [4] Colouring Clique-Hypergraphs of Circulant Graphs
    C. N. Campos
    S. Dantas
    C. P. de Mello
    Graphs and Combinatorics, 2013, 29 : 1713 - 1720
  • [5] Dynamic coloring of graphs having no K5 minor
    Kim, Younjin
    Lee, Sang June
    Oum, Sang-il
    DISCRETE APPLIED MATHEMATICS, 2016, 206 : 81 - 89
  • [6] The (a, b)-monochromatic transversal game on clique-hypergraphs of powers of cycles
    Mendes, Wilder P.
    Dantas, Simone
    Gravier, Sylvain
    RAIRO-OPERATIONS RESEARCH, 2024, 58 (02) : 1759 - 1770
  • [7] Graphs With 3n−6 Edges Not Containing A Subdivision Of K5
    Wolfgang Mader
    Combinatorica, 2005, 25 : 425 - 438
  • [8] Graphs with 3n-6 edges not containing a subdivision of K5
    Mader, W
    COMBINATORICA, 2005, 25 (04) : 425 - 438
  • [9] Structure of 4-connected claw-free graphs not containing a subdivision of K5
    Krakovski, Roi
    Stephens, D. Christopher
    DISCRETE MATHEMATICS, 2011, 311 (12) : 908 - 910
  • [10] On the complexity of bicoloring clique hypergraphs of graphs
    Kratochvíl, J
    Tuza, Z
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2002, 45 (01): : 40 - 54