Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces

Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard Woeginger

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    It is well known that any set of n intervals in (Formula Presented) admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate generalizations of this result to colorings of objects in more complex 1-dimensional spaces, namely so-called tree spaces and planar network spaces.

    Original languageEnglish (US)
    Title of host publicationComputing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings
    PublisherSpringer-Verlag
    Pages567-578
    Number of pages12
    ISBN (Print)9783319947754
    DOIs
    StatePublished - Jan 1 2018
    Event24th International Conference on Computing and Combinatorics Conference, COCOON 2018 - Qing Dao, China
    Duration: Jul 2 2018Jul 4 2018

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume10976 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other24th International Conference on Computing and Combinatorics Conference, COCOON 2018
    CountryChina
    CityQing Dao
    Period7/2/187/4/18

    Fingerprint

    Coloring
    Colouring
    Color
    Interval
    Conflict

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Aronov, B., de Berg, M., Markovic, A., & Woeginger, G. (2018). Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces. In Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings (pp. 567-578). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10976 LNCS). Springer-Verlag. https://doi.org/10.1007/978-3-319-94776-1_47

    Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces. / Aronov, Boris; de Berg, Mark; Markovic, Aleksandar; Woeginger, Gerhard.

    Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings. Springer-Verlag, 2018. p. 567-578 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10976 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Aronov, B, de Berg, M, Markovic, A & Woeginger, G 2018, Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces. in Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10976 LNCS, Springer-Verlag, pp. 567-578, 24th International Conference on Computing and Combinatorics Conference, COCOON 2018, Qing Dao, China, 7/2/18. https://doi.org/10.1007/978-3-319-94776-1_47
    Aronov B, de Berg M, Markovic A, Woeginger G. Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces. In Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings. Springer-Verlag. 2018. p. 567-578. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-94776-1_47
    Aronov, Boris ; de Berg, Mark ; Markovic, Aleksandar ; Woeginger, Gerhard. / Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces. Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings. Springer-Verlag, 2018. pp. 567-578 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{e9f4d4adeabc4429b1a52acf42d8b67d,
    title = "Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces",
    abstract = "It is well known that any set of n intervals in (Formula Presented) admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate generalizations of this result to colorings of objects in more complex 1-dimensional spaces, namely so-called tree spaces and planar network spaces.",
    author = "Boris Aronov and {de Berg}, Mark and Aleksandar Markovic and Gerhard Woeginger",
    year = "2018",
    month = "1",
    day = "1",
    doi = "10.1007/978-3-319-94776-1_47",
    language = "English (US)",
    isbn = "9783319947754",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer-Verlag",
    pages = "567--578",
    booktitle = "Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings",

    }

    TY - GEN

    T1 - Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces

    AU - Aronov, Boris

    AU - de Berg, Mark

    AU - Markovic, Aleksandar

    AU - Woeginger, Gerhard

    PY - 2018/1/1

    Y1 - 2018/1/1

    N2 - It is well known that any set of n intervals in (Formula Presented) admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate generalizations of this result to colorings of objects in more complex 1-dimensional spaces, namely so-called tree spaces and planar network spaces.

    AB - It is well known that any set of n intervals in (Formula Presented) admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate generalizations of this result to colorings of objects in more complex 1-dimensional spaces, namely so-called tree spaces and planar network spaces.

    UR - http://www.scopus.com/inward/record.url?scp=85049675349&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85049675349&partnerID=8YFLogxK

    U2 - 10.1007/978-3-319-94776-1_47

    DO - 10.1007/978-3-319-94776-1_47

    M3 - Conference contribution

    SN - 9783319947754

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 567

    EP - 578

    BT - Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings

    PB - Springer-Verlag

    ER -