Equitable coloring of hypergraphs
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-com...
Gespeichert in:
| Veröffentlicht in: | Discrete Applied Mathematics 2019-05, Vol.261, p.186-192 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 192 |
|---|---|
| container_issue | |
| container_start_page | 186 |
| container_title | Discrete Applied Mathematics |
| container_volume | 261 |
| creator | Furmańczyk, Hanna Obszarski, Paweł |
| description | 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. |
| doi_str_mv | 10.1016/j.dam.2019.01.016 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2233936806</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0166218X19300332</els_id><sourcerecordid>2233936806</sourcerecordid><originalsourceid>FETCH-LOGICAL-c368t-d185934fce9b5d956e56af58fde7a52d9f6303137e8b4d1714d47d04baa3b4d53</originalsourceid><addsrcrecordid>eNp9UE1LAzEUDKJgrf4AbxXPu-ZtNskunqTUDyh4UfAWsslLm6VttslW8N-bUs_CwOMNM28eQ8gt0BIoiIe-tHpbVhTakkKGOCMTaGRVCCnhnEwyI4oKmq9LcpVSTymFvE3I3WJ_8KPuNjgzYROi361mwc3WPwPGVdTDOl2TC6c3CW_-5pR8Pi8-5q_F8v3lbf60LAwTzVhYaHjLamew7bhtuUAutOONsyg1r2zrBKMMmMSmqy1IqG0tLa07rVkmOJuS-9PdIYb9AdOo-nCIuxypqoqxNqdQkVVwUpkYUoro1BD9VscfBVQdm1C9yk2oYxOKQsbR83jyYH7_22NUyXjcGbQ-ohmVDf4f9y_lcGTM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2233936806</pqid></control><display><type>article</type><title>Equitable coloring of hypergraphs</title><source>Elsevier ScienceDirect Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Furmańczyk, Hanna ; Obszarski, Paweł</creator><creatorcontrib>Furmańczyk, Hanna ; Obszarski, Paweł</creatorcontrib><description>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.</description><identifier>ISSN: 0166-218X</identifier><identifier>EISSN: 1872-6771</identifier><identifier>DOI: 10.1016/j.dam.2019.01.016</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Apexes ; Color ; Coloring ; Dynamic programming ; Equitable coloring ; Feasible sequence ; Graph theory ; Graphs ; Hypergraph ; Linear hypertree ; Polynomials</subject><ispartof>Discrete Applied Mathematics, 2019-05, Vol.261, p.186-192</ispartof><rights>2019 Elsevier B.V.</rights><rights>Copyright Elsevier BV May 31, 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c368t-d185934fce9b5d956e56af58fde7a52d9f6303137e8b4d1714d47d04baa3b4d53</citedby><cites>FETCH-LOGICAL-c368t-d185934fce9b5d956e56af58fde7a52d9f6303137e8b4d1714d47d04baa3b4d53</cites><orcidid>0000-0002-3277-1104</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0166218X19300332$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3536,27903,27904,65309</link.rule.ids></links><search><creatorcontrib>Furmańczyk, Hanna</creatorcontrib><creatorcontrib>Obszarski, Paweł</creatorcontrib><title>Equitable coloring of hypergraphs</title><title>Discrete Applied Mathematics</title><description>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.</description><subject>Algorithms</subject><subject>Apexes</subject><subject>Color</subject><subject>Coloring</subject><subject>Dynamic programming</subject><subject>Equitable coloring</subject><subject>Feasible sequence</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Hypergraph</subject><subject>Linear hypertree</subject><subject>Polynomials</subject><issn>0166-218X</issn><issn>1872-6771</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp9UE1LAzEUDKJgrf4AbxXPu-ZtNskunqTUDyh4UfAWsslLm6VttslW8N-bUs_CwOMNM28eQ8gt0BIoiIe-tHpbVhTakkKGOCMTaGRVCCnhnEwyI4oKmq9LcpVSTymFvE3I3WJ_8KPuNjgzYROi361mwc3WPwPGVdTDOl2TC6c3CW_-5pR8Pi8-5q_F8v3lbf60LAwTzVhYaHjLamew7bhtuUAutOONsyg1r2zrBKMMmMSmqy1IqG0tLa07rVkmOJuS-9PdIYb9AdOo-nCIuxypqoqxNqdQkVVwUpkYUoro1BD9VscfBVQdm1C9yk2oYxOKQsbR83jyYH7_22NUyXjcGbQ-ohmVDf4f9y_lcGTM</recordid><startdate>20190531</startdate><enddate>20190531</enddate><creator>Furmańczyk, Hanna</creator><creator>Obszarski, Paweł</creator><general>Elsevier B.V</general><general>Elsevier BV</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-3277-1104</orcidid></search><sort><creationdate>20190531</creationdate><title>Equitable coloring of hypergraphs</title><author>Furmańczyk, Hanna ; Obszarski, Paweł</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c368t-d185934fce9b5d956e56af58fde7a52d9f6303137e8b4d1714d47d04baa3b4d53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Apexes</topic><topic>Color</topic><topic>Coloring</topic><topic>Dynamic programming</topic><topic>Equitable coloring</topic><topic>Feasible sequence</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Hypergraph</topic><topic>Linear hypertree</topic><topic>Polynomials</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Furmańczyk, Hanna</creatorcontrib><creatorcontrib>Obszarski, Paweł</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Discrete Applied Mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Furmańczyk, Hanna</au><au>Obszarski, Paweł</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Equitable coloring of hypergraphs</atitle><jtitle>Discrete Applied Mathematics</jtitle><date>2019-05-31</date><risdate>2019</risdate><volume>261</volume><spage>186</spage><epage>192</epage><pages>186-192</pages><issn>0166-218X</issn><eissn>1872-6771</eissn><abstract>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.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.dam.2019.01.016</doi><tpages>7</tpages><orcidid>https://orcid.org/0000-0002-3277-1104</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0166-218X |
| ispartof | Discrete Applied Mathematics, 2019-05, Vol.261, p.186-192 |
| issn | 0166-218X 1872-6771 |
| language | eng |
| recordid | cdi_proquest_journals_2233936806 |
| source | Elsevier ScienceDirect Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Algorithms Apexes Color Coloring Dynamic programming Equitable coloring Feasible sequence Graph theory Graphs Hypergraph Linear hypertree Polynomials |
| title | Equitable coloring of hypergraphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T11%3A24%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Equitable%20coloring%20of%20hypergraphs&rft.jtitle=Discrete%20Applied%20Mathematics&rft.au=Furma%C5%84czyk,%20Hanna&rft.date=2019-05-31&rft.volume=261&rft.spage=186&rft.epage=192&rft.pages=186-192&rft.issn=0166-218X&rft.eissn=1872-6771&rft_id=info:doi/10.1016/j.dam.2019.01.016&rft_dat=%3Cproquest_cross%3E2233936806%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2233936806&rft_id=info:pmid/&rft_els_id=S0166218X19300332&rfr_iscdi=true |