Equitable coloring of hypergraphs

被引：3
|
作者：
Furmanczyk, Hanna [1 ]
Obszarski, Pawel [2 ]
机构：
[1] Univ Gdansk, Inst Informat, Wita Stwosza 57, PL-80309 Gdansk, Poland
[2] Gdansk Univ Technol, Dept Algorithms & Syst Modeling, Narutowicza 11-12, PL-80233 Gdansk, Poland
来源：
DISCRETE APPLIED MATHEMATICS | 2019年 / 261卷
关键词：
Equitable coloring; Hypergraph; Linear hypertree; Feasible sequence; GRAPHS;
D O I：
10.1016/j.dam.2019.01.016
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A hypergraph is equitably k-colorable if its vertices can be partitioned into k sets/color classes in such a way that monochromatic edges are avoided and the number of vertices in any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to equitably k-color linear hypertrees, where k >= 2 is fixed. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码：186 / 192
页数：7
相关论文
共 50 条
  • [41] Total Equitable List Coloring
    Kaul, Hemanshu
    Mudrock, Jeffrey A.
    Pelsmajer, Michael J.
    [J]. GRAPHS AND COMBINATORICS, 2018, 34 (06) : 1637 - 1649
  • [42] On equitable coloring of bipartite graphs
    Lih, KW
    Wu, PL
    [J]. DISCRETE MATHEMATICS, 1996, 151 (1-3) : 155 - 160
  • [43] A FAST ALGORITHM FOR EQUITABLE COLORING
    Kierstead, Henry A.
    Kostochka, Alexandr V.
    Mydlarz, Marcelo
    Szemeredi, Endre
    [J]. COMBINATORICA, 2010, 30 (02) : 217 - 224
  • [44] On equitable total coloring of snarks
    Goncalves, Isabel F. A.
    Dantas, Simone
    Sasaki, Diana
    [J]. PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2021, 195 : 334 - 342
  • [45] From NMNR-coloring of hypergraphs to homogenous coloring of graphs
    Janicova, Maria
    Madaras, Tomas
    Sotak, Roman
    Luzar, Borut
    [J]. ARS MATHEMATICA CONTEMPORANEA, 2017, 12 (02) : 351 - 360
  • [46] Note on equitable coloring of graphs
    Karthick, T.
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2014, 59 : 251 - 259
  • [47] Kernelization results for Equitable Coloring
    Gomes, Guilherme C. M.
    dos Santos, Vinicius F.
    [J]. PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2021, 195 : 59 - 67
  • [48] Total Equitable List Coloring
    Hemanshu Kaul
    Jeffrey A. Mudrock
    Michael J. Pelsmajer
    [J]. Graphs and Combinatorics, 2018, 34 : 1637 - 1649
  • [49] Equitable Colorings of Hypergraphs with r Colors
    Akhmejanova M.
    Shabanov D.A.
    [J]. Journal of Mathematical Sciences, 2022, 262 (4) : 391 - 405
  • [50] Regarding equitable colorability defect of hypergraphs
    Shaebani, Saeed
    [J]. HACETTEPE JOURNAL OF MATHEMATICS AND STATISTICS, 2024, 53 (01): : 184 - 190
12345