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 条
  • [21] Noncontextual coloring of orthogonality hypergraphs
    Shekarriz, Mohammad H.
    Svozil, Karl
    [J]. JOURNAL OF MATHEMATICAL PHYSICS, 2022, 63 (03)
  • [22] Coloring hypergraphs of low connectivity
    Schweser, Thomas
    Stiebitz, Michael
    Toft, Bjarne
    [J]. JOURNAL OF COMBINATORICS, 2022, 13 (01) : 1 - 21
  • [23] HARMONIOUS COLORING OF UNIFORM HYPERGRAPHS
    Bosek, Bartlomiej
    Czerwinski, Sebastian
    Grytczuk, Jaroslaw
    Rzazewski, Pawel
    [J]. APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2016, 10 (01) : 73 - 87
  • [24] 2-COLORING OF HYPERGRAPHS
    SEYMOUR, PD
    [J]. QUARTERLY JOURNAL OF MATHEMATICS, 1974, 25 (99): : 303 - 312
  • [25] Proper Coloring of Geometric Hypergraphs
    Balázs Keszegh
    Dömötör Pálvölgyi
    [J]. Discrete & Computational Geometry, 2019, 62 : 674 - 689
  • [26] Randomly coloring simple hypergraphs
    Frieze, Alan
    Melsted, Pall
    [J]. INFORMATION PROCESSING LETTERS, 2011, 111 (17) : 848 - 853
  • [27] On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
    Bretto, Alain
    Faisant, Alain
    Hennecart, Francois
    [J]. DISCRETE MATHEMATICS, 2020, 343 (11)
  • [28] A list analogue of equitable coloring
    Kostochka, AV
    Pelsmajer, MJ
    West, DB
    [J]. JOURNAL OF GRAPH THEORY, 2003, 44 (03) : 166 - 177
  • [29] Domination Equitable Coloring of graphs
    Haribabu, Rebekal
    Arul, Sharmila Mary
    [J]. INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 2024, 19 (04): : 1417 - 1420
  • [30] On equitable coloring of corona of wheels
    Vivin, J. Vernold
    Kaliraj, K.
    [J]. ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2016, 4 (02) : 206 - 222
12345