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
来源：
Theoretical Computer Science | 2015年 / 592卷
基金：
中国国家自然科学基金;
关键词：
Chromatic number - Free graphs - Hyperedges - Hypergraph - Maximal clique - Odd cycle - Planar graph - Polynomial-time algorithms;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：166 / 175
相关论文
共 50 条
  • [21] On the complexity of bicoloring clique hypergraphs of graphs (extended abstract)
    Kratochvíl, J
    Tuza, Z
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 40 - 41
  • [22] Unfriendly partitions for graphs not containing a subdivision of an infinite clique
    Eli Berger
    Combinatorica, 2017, 37 : 157 - 166
  • [23] Subdivisions of K5 in graphs containing K2,3
    Kawarabayashia, Ken-ichi
    Ma, Jie
    Yu, Xingxing
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 113 : 18 - 67
  • [24] Unfriendly partitions for graphs not containing a subdivision of an infinite clique
    Berger, Eli
    COMBINATORICA, 2017, 37 (02) : 157 - 166
  • [25] Extremal hypergraphs and bounds for the Turan density of the 4-uniform K5
    Markstrom, Klas
    DISCRETE MATHEMATICS, 2009, 309 (16) : 5231 - 5234
  • [26] The clique-perfectness and clique-coloring of outer-planar graphs
    Zuosong Liang
    Erfang Shan
    Liying Kang
    Journal of Combinatorial Optimization, 2019, 38 : 794 - 807
  • [27] The clique-perfectness and clique-coloring of outer-planar graphs
    Liang, Zuosong
    Shan, Erfang
    Kang, Liying
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (03) : 794 - 807
  • [28] Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
    Balogh, Jozsef
    Cherkashin, Danila
    Kiselev, Sergei
    EUROPEAN JOURNAL OF COMBINATORICS, 2019, 79 : 228 - 236
  • [29] Clique-Coloring Claw-Free Graphs
    Zuosong Liang
    Erfang Shan
    Liying Kang
    Graphs and Combinatorics, 2016, 32 : 1473 - 1488
  • [30] Estimating clique size by coloring the nodes of auxiliary graphs
    Szabo, Sandor
    ACTA UNIVERSITATIS SAPIENTIAE INFORMATICA, 2018, 10 (02) : 137 - 157
12345