IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v339y2018icp153-157.html
   My bibliography  Save this article

Polychromatic colorings and cover decompositions of hypergraphs

Author

Listed:
  • Li, Tingting
  • Zhang, Xia

Abstract

A polychromatic coloring of a hypergraph is a coloring of its vertices in such a way that every hyperedge contains at least one vertex of each color. A polychromatic m-coloring of a hypergraph H corresponds to a cover m-decomposition of its dual hypergraph H*. The maximum integer m that a hypergraph H admits a cover m-decomposition is exactly the longest lifetime for a wireless sensor network (WSN) corresponding to the hypergraph H. In this paper, we show that every hypergraph H has a polychromatic m-coloring if m≤⌊Sln(cΔS2)⌋, where 0 < c < 1, and Δ ≥ 1, S ≥ 2 are the maximum degree, the minimum size for all hyperedges in H, respectively. This result improves a result of Henning and Yeo on polychromatic colorings of hypergraphs in 2013, and its dual form improves one of Bollobás, Pritchard, Rothvoß, and Scott on cover decompositions of hypergraphs in 2013. Furthermore, we give a sufficient condition for a hypergraph H to have an “equitable” polychromatic coloring, which extends the result of Henning and Yeo in 2013 and improves in part one of Beck and Fiala in 1981 on 2-colorings (property B) of hypergraphs.

Suggested Citation

  • Li, Tingting & Zhang, Xia, 2018. "Polychromatic colorings and cover decompositions of hypergraphs," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 153-157.
    • Handle: RePEc:eee:apmaco:v:339:y:2018:i:c:p:153-157
    DOI: 10.1016/j.amc.2018.07.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318305770
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.07.019?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:339:y:2018:i:c:p:153-157. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.