Good and nice colorings of balanced hypergraphs

被引：0
|
作者：
de Werra, D. [1 ]
机构：
[1] Ecole Polytech Fed Lausanne, Fac Sci Base, Inst Math IMA RO SE, CH-1015 Lausanne, Switzerland
来源：
DISCRETE MATHEMATICS | 2006年 / 306卷 / 19-20期
关键词：
balanced matrices; oriented hypergraphs; good colorings; totally unimodular matrices;
D O I：
10.1016/j.disc.2005.12.044
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Good k-colorings have been defined by C. Berge who showed their existence in balanced hypergraphs. There is a simple generalization to oriented balanced hypergraphs: using the bi-coloring characterization of 0, +/- 1-matrices of M. Conforti and G. Comuejols, we show that oriented balanced hypergraphs have good k-colorings for any k. A stronger type of coloring is also shown to exist for oriented balanced hypergraphs. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：2630 / 2636
页数：7
相关论文
共 50 条
  • [1] On balanced colorings of hypergraphs
    Rozovskaya A.P.
    Titova M.V.
    Shabanov D.A.
    [J]. Journal of Mathematical Sciences, 2010, 169 (5) : 654 - 670
  • [2] On balanced colorings of sparse hypergraphs
    Dudek, Andrzej
    [J]. DISCRETE MATHEMATICS, 2014, 323 : 63 - 68
  • [3] Balanced Independent Sets and Colorings of Hypergraphs
    Dhawan, Abhishek
    [J]. Journal of Graph Theory,
  • [4] On colorings of hypergraphs
    Shabanov, DA
    [J]. DOKLADY MATHEMATICS, 2005, 71 (03) : 438 - 441
  • [5] Perfect colorings of hypergraphs
    Sobolev Institute of Mathematics, Novosibirsk, Russia
    [J]. arXiv, 1600,
  • [6] On proper colorings of hypergraphs
    Gravin N.V.
    Karpov D.V.
    [J]. Journal of Mathematical Sciences, 2012, 184 (5) : 595 - 600
  • [7] On Equitable Colorings of Hypergraphs
    M. Akhmejanova
    [J]. Mathematical Notes, 2019, 106 : 319 - 326
  • [8] SUBDIVISION OF HYPERGRAPHS AND THEIR COLORINGS
    Iradmusa, Moharram N.
    [J]. OPUSCULA MATHEMATICA, 2020, 40 (02) : 271 - 290
  • [9] On Equitable Colorings of Hypergraphs
    Akhmejanova, M.
    [J]. MATHEMATICAL NOTES, 2019, 106 (3-4) : 319 - 326
  • [10] Strong colorings of hypergraphs
    Agnarsson, G
    Halldórsson, MM
    [J]. APPROXIMATION AND ONLINE ALGORITHMS, 2004, 3351 : 253 - 266
12345