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 条
  • [31] Coloring powers of graphs of bounded clique-width
    Todinca, I
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2003, 2880 : 370 - 382
  • [32] Clique-Coloring Claw-Free Graphs
    Liang, Zuosong
    Shan, Erfang
    Kang, Liying
    GRAPHS AND COMBINATORICS, 2016, 32 (04) : 1473 - 1488
  • [33] Clique coloring B1-EPG graphs
    Bonomo, Flavia
    Pia Mazzoleni, Maria
    Stein, Maya
    DISCRETE MATHEMATICS, 2017, 340 (05) : 1008 - 1011
  • [34] AN EXTENSION OF REGULAR COLORING OF GRAPHS TO DIGRAPHS, NETWORKS AND HYPERGRAPHS
    EVERETT, MG
    BORGATTI, SP
    SOCIAL NETWORKS, 1993, 15 (03) : 237 - 254
  • [35] An explicit edge-coloring of Kn with six colors on every K5
    Cameron, Alex
    ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (04):
  • [36] THE MAX-CUT PROBLEM ON GRAPHS NOT CONTRACTIBLE TO K5
    BARAHONA, F
    OPERATIONS RESEARCH LETTERS, 1983, 2 (03) : 107 - 111
  • [37] CONTRACTION, K-DEFICIT, AND THE COLORING OF HYPERGRAPHS
    KHACHATRYAN, MA
    CYBERNETICS, 1983, 19 (06): : 757 - 762
  • [38] Equitable coloring of k-uniform hypergraphs
    Yuster, R
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 16 (04) : 524 - 532
  • [39] Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
    Bhyravarapu, Sriram
    Hartmann, Tim A.
    Kalyanasundaram, Subrahmanyam
    Reddy, I. Vinod
    COMBINATORIAL ALGORITHMS, IWOCA 2021, 2021, 12757 : 92 - 106
  • [40] K5--SUBDIVISION IN 4-CONNECTED GRAPHS
    Lu, Changhong
    Zhang, Ping
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (04) : 2900 - 2915
12345