{ "labelLang" : "hun", "responseDate" : "2024-03-28 09:15", "content" : { "otype" : "JournalArticle", "mtid" : 2160173, "status" : "ADMIN_APPROVED", "published" : true, "comment" : "Funding Agency and Grant Number: Hungarian Scientific Research Fund, OTKAOrszagos Tudomanyos Kutatasi Alapprogramok (OTKA) [49613, 81493]\n Funding text: This research was supported in part by the Hungarian Scientific Research Fund, OTKA grants 49613 and 81493.\nCited By :3 \n Export Date: 20 January 2020 \n CODEN: JCOPF \n Correspondence Address: Tuza, Z.; Department of Computer Science and Systems Technology, University of Pannonia, Egyetem u. 10, 8200 Veszprém, Hungary; email: tuza@dcs.uni-pannon.hu \n Funding details: Hungarian Scientific Research Fund \n Funding details: Hungarian Scientific Research Fund, 49613, 81493 \n Funding text 1: Acknowledgments This research was supported in part by the Hungarian Scientific Research Fund, OTKA grants 49613 and 81493.", "unhandledTickets" : 0, "oldTimestamp" : "2015-11-24T20:03:34.000+0000", "deleted" : false, "oldId" : 2160173, "lastRefresh" : "2024-03-26T13:27:34.680+0000", "lastModified" : "2020-12-22T11:39:55.755+0000", "created" : "2013-01-09T16:38:54.000+0000", "creator" : { "otype" : "Author", "mtid" : 10006593, "link" : "/api/author/10006593", "label" : "Tuza Zsolt (Kombinatorika és gráfelmélet)", "familyName" : "Tuza", "givenName" : "Zsolt", "published" : true, "oldId" : 10006593, "snippet" : true }, "lastDuplumSearch" : "2023-03-24T09:54:22.117+0000", "adminApproved" : "2014-01-30T21:53:43.000+0000", "adminApprover" : { "otype" : "Admin", "mtid" : 10015168, "link" : "/api/admin/10015168", "label" : "Szakonyi Erzsebet (RAMKI admin 4)", "familyName" : "Szakonyi", "givenName" : "Erzsebet", "published" : true, "oldId" : 10015168, "snippet" : true }, "core" : true, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000059, "link" : "/api/subtype/10000059", "label" : "Szakcikk (Folyóiratcikk)", "name" : "Szakcikk", "nameEng" : "Article", "docType" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "listPosition" : 101, "published" : true, "oldId" : 10000059, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "firstAuthor" : "Hegyháti, M", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 3406275, "link" : "/api/authorship/3406275", "label" : "Hegyháti, M [Hegyháti, Máté (Optimalizálás, sz...), szerző] Rendszer- és Számítástudományi Tanszék (PE / MIK)", "listPosition" : 1, "share" : 0.5, "first" : true, "last" : false, "author" : { "otype" : "Author", "mtid" : 10029944, "link" : "/api/author/10029944", "label" : "Hegyháti Máté (Optimalizálás, szakaszos üzemű vegyipari rendszerek)", "familyName" : "Hegyháti", "givenName" : "Máté", "published" : true, "oldId" : 10029944, "snippet" : true }, "familyName" : "Hegyháti", "givenName" : "M", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 16238215, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 3406276, "link" : "/api/authorship/3406276", "label" : "Tuza, Zs [Tuza, Zsolt (Kombinatorika és ...), szerző] MTA Rényi Alfréd Matematikai Kutatóintézet", "listPosition" : 2, "share" : 0.5, "first" : false, "last" : true, "author" : { "otype" : "Author", "mtid" : 10006593, "link" : "/api/author/10006593", "label" : "Tuza Zsolt (Kombinatorika és gráfelmélet)", "familyName" : "Tuza", "givenName" : "Zsolt", "published" : true, "oldId" : 10006593, "snippet" : true }, "familyName" : "Tuza", "givenName" : "Zs", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 16238214, "snippet" : true } ], "title" : "Colorability of mixed hypergraphs and their chromatic inversions", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 611005, "link" : "/api/publicationidentifier/611005", "label" : "DOI: 10.1007/s10878-012-9559-7", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "oaFree" : false, "validState" : "IDENTICAL", "idValue" : "10.1007/s10878-012-9559-7", "realUrl" : "https://doi.org/10.1007/s10878-012-9559-7", "published" : false, "oldId" : 381964, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 611003, "link" : "/api/publicationidentifier/611003", "label" : "WoS: 000317973700019", "source" : { "otype" : "PlainSource", "mtid" : 1, "link" : "/api/publicationsource/1", "label" : "WoS", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "WoS", "nameEng" : "WoS", "linkPattern" : "https://www.webofscience.com/wos/woscc/full-record/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 1, "snippet" : true }, "oaFree" : false, "validState" : "IDENTICAL", "idValue" : "000317973700019", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000317973700019", "published" : false, "oldId" : 592600, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 611004, "link" : "/api/publicationidentifier/611004", "label" : "Scopus: 84877814014", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "oaFree" : false, "validState" : "IDENTICAL", "idValue" : "84877814014", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84877814014", "published" : false, "oldId" : 381965, "snippet" : true } ], "journal" : { "otype" : "Journal", "mtid" : 18372, "link" : "/api/journal/18372", "label" : "JOURNAL OF COMBINATORIAL OPTIMIZATION 1382-6905 1573-2886", "pIssn" : "1382-6905", "eIssn" : "1573-2886", "reviewType" : "REVIEWED", "noIF" : false, "sciIndexed" : true, "scopusIndexed" : true, "lang" : "FOREIGN", "hungarian" : false, "published" : true, "oldId" : 18372, "snippet" : true }, "volume" : "25", "issue" : "4", "firstPage" : "737", "lastPage" : "751", "firstPageOrInternalIdForSort" : "737", "pageLength" : 15, "publishedYear" : 2013, "abstractText" : "We solve a long-standing open problem concerning a discrete mathematical model, which has various applications in computer science and several other fields, including frequency assignment and many other problems on resource allocation. A mixed hypergraph {Mathematical expression} is a triple {Mathematical expression}, where {Mathematical expression} is the set of vertices, and {Mathematical expression} and {Mathematical expression} are two set systems over {Mathematical expression}, the families of so-called C-edges and D-edges, respectively. A vertex coloring of a mixed hypergraph {Mathematical expression} is proper if every C-edge has two vertices with a common color and every D-edge has two vertices with different colors. A mixed hypergraph is colorable if it has at least one proper coloring; otherwise it is uncolorable. The chromatic inversion of a mixed hypergraph {Mathematical expression} is defined as {Mathematical expression}. Since 1995, it was an open problem wether there is a correlation between the colorability properties of a hypergraph and its chromatic inversion. In this paper we answer this question in the negative, proving that there exists no polynomial-time algorithm (provided that {Mathematical expression}) to decide whether both {Mathematical expression} and {Mathematical expression} are colorable, or both are uncolorable. This theorem holds already for the restricted class of 3-uniform mixed hypergraphs (i.e., where every edge has exactly three vertices). The proof is based on a new polynomial-time algorithm for coloring a special subclass of 3-uniform mixed hypergraphs. Implementation in C++ programming language has been tested. Further related decision problems are investigated, too. © 2012 Springer Science+Business Media New York.", "subjects" : [ { "otype" : "Classification", "mtid" : 10018, "link" : "/api/classification/10018", "label" : "Diszkrét matematika és kombinatorika", "published" : true, "snippet" : true }, { "otype" : "Classification", "mtid" : 10004, "link" : "/api/classification/10004", "label" : "Elméleti és alkalmazott matematika", "published" : true, "snippet" : true }, { "otype" : "Classification", "mtid" : 10003, "link" : "/api/classification/10003", "label" : "Matematika", "published" : true, "snippet" : true }, { "otype" : "Classification", "mtid" : 10034, "link" : "/api/classification/10034", "label" : "Számítás- és információtudomány", "published" : true, "snippet" : true } ], "keywords" : [ { "otype" : "Keyword", "mtid" : 3673, "link" : "/api/keyword/3673", "label" : "Mathematical models", "published" : true, "oldId" : 3673, "snippet" : true }, { "otype" : "Keyword", "mtid" : 3698, "link" : "/api/keyword/3698", "label" : "Algorithms", "published" : true, "oldId" : 3698, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1016204, "link" : "/api/keyword/1016204", "label" : "Graph theory", "published" : true, "oldId" : 1016204, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1052014, "link" : "/api/keyword/1052014", "label" : "Problem oriented languages", "published" : true, "oldId" : 1052014, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1068071, "link" : "/api/keyword/1068071", "label" : "Algorithmic complexity", "published" : true, "oldId" : 1068071, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1068073, "link" : "/api/keyword/1068073", "label" : "Hypergraph coloring", "published" : true, "oldId" : 1068073, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1068089, "link" : "/api/keyword/1068089", "label" : "Mixed hypergraph", "published" : true, "oldId" : 1068089, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1068855, "link" : "/api/keyword/1068855", "label" : "Polynomial-time algorithms", "published" : true, "oldId" : 1068855, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1082907, "link" : "/api/keyword/1082907", "label" : "decision problems", "published" : true, "oldId" : 1082907, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1154004, "link" : "/api/keyword/1154004", "label" : "Frequency assignments", "published" : true, "oldId" : 1154004, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1198450, "link" : "/api/keyword/1198450", "label" : "Chromatic inversion", "published" : true, "oldId" : 1198450, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1292677, "link" : "/api/keyword/1292677", "label" : "Discrete mathematical models", "published" : true, "oldId" : 1292677, "snippet" : true } ], "digital" : null, "printed" : null, "sourceYear" : 2013, "packet" : "530249", "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : false, "nationalOrigin" : true, "missingAuthor" : false, "oaType" : "NONE", "oaCheckDate" : "2024-03-26", "oaFree" : false, "oaByAuthor" : { "otype" : "Admin", "mtid" : 10015168, "link" : "/api/admin/10015168", "label" : "Szakonyi Erzsebet (RAMKI admin 4)", "familyName" : "Szakonyi", "givenName" : "Erzsebet", "published" : true, "oldId" : 10015168, "snippet" : true }, "citationCount" : 3, "citationCountUnpublished" : 0, "citationCountWoOther" : 3, "independentCitCountWoOther" : 2, "nationalOriginCitationCount" : 1, "foreignEditionCitationCount" : 3, "doiCitationCount" : 3, "wosCitationCount" : 2, "scopusCitationCount" : 3, "wosScopusCitationCount" : 3, "wosScopusCitationCountWoOther" : 3, "wosScopusIndependentCitationCount" : 2, "wosScopusIndependentCitationCountWoOther" : 2, "independentCitationCount" : 2, "selfCitationCount" : 1, "unhandledCitationCount" : 0, "citingPubCount" : 3, "independentCitingPubCount" : 2, "citingPubCountWoOther" : 3, "independentCitingPubCountWoOther" : 2, "unhandledCitingPubCount" : 0, "citedPubCount" : 6, "citedCount" : 6, "pubStats" : { "types" : [ { "type" : "Folyóiratcikk", "typeEng" : "Journal Article", "code" : 24, "count" : 2 }, { "type" : "Könyvrészlet", "typeEng" : "Chapter in Book", "code" : 25, "count" : 1 }, { "type" : "Könyv", "typeEng" : "Book", "code" : 23, "count" : 0 }, { "type" : "Egyéb konferenciaközlemény", "typeEng" : "Conference paper", "code" : 31, "count" : 0 }, { "type" : "Egyéb konferenciakötet", "typeEng" : "Conference proceedings", "code" : 32, "count" : 0 }, { "type" : "Oltalmi formák", "typeEng" : "Protection forms", "code" : 26, "count" : 0 }, { "type" : "Disszertáció", "typeEng" : "Thesis", "code" : 28, "count" : 0 }, { "type" : "Egyéb", "typeEng" : "Miscellaneous", "code" : 29, "count" : 0 }, { "type" : "Alkotás", "typeEng" : "Achievement", "code" : 22, "count" : 0 }, { "type" : "Kutatási adat", "typeEng" : "Research data", "code" : 33, "count" : 0 } ], "citationTypes" : [ { "type" : "Folyóiratcikk", "typeEng" : "Journal Article", "code" : 24, "countUnknown" : 0, "countIndependent" : 0, "countSelfCitation" : 0 }, { "type" : "Könyvrészlet", "typeEng" : "Chapter in Book", "code" : 25, "countUnknown" : 0, "countIndependent" : 0, "countSelfCitation" : 0 }, { "type" : "Könyv", "typeEng" : "Book", "code" : 23, "countUnknown" : 0, "countIndependent" : 0, "countSelfCitation" : 0 }, { "type" : "Egyéb konferenciaközlemény", "typeEng" : "Conference paper", "code" : 31, "countUnknown" : 0, "countIndependent" : 0, "countSelfCitation" : 0 }, { "type" : "Egyéb konferenciakötet", "typeEng" : "Conference proceedings", "code" : 32, "countUnknown" : 0, "countIndependent" : 0, "countSelfCitation" : 0 }, { "type" : "Oltalmi formák", "typeEng" : "Protection forms", "code" : 26, "countUnknown" : 0, "countIndependent" : 0, "countSelfCitation" : 0 }, { "type" : "Disszertáció", "typeEng" : "Thesis", "code" : 28, "countUnknown" : 0, "countIndependent" : 0, "countSelfCitation" : 0 }, { "type" : "Egyéb", "typeEng" : "Miscellaneous", "code" : 29, "countUnknown" : 0, "countIndependent" : 0, "countSelfCitation" : 0 }, { "type" : "Alkotás", "typeEng" : "Achievement", "code" : 22, "countUnknown" : 0, "countIndependent" : 0, "countSelfCitation" : 0 }, { "type" : "Kutatási adat", "typeEng" : "Research data", "code" : 33, "countUnknown" : 0, "countIndependent" : 0, "countSelfCitation" : 0 } ], "years" : [ { "year" : 2014, "publicationCount" : 0, "citationCount" : 2, "independentCitationCount" : 1, "citingPubCount" : 2, "independentCitingPubCount" : 1, "oaStats" : null, "oaStats2" : null }, { "year" : 2015, "publicationCount" : 0, "citationCount" : 1, "independentCitationCount" : 1, "citingPubCount" : 1, "independentCitingPubCount" : 1, "oaStats" : null, "oaStats2" : null } ] }, "ratings" : [ { "otype" : "MtaRating", "mtid" : 11509788, "link" : "/api/mtarating/11509788", "label" : "IX. Gazdaságtudományi Doktori Minősítő Bizottság:B nemzetközi JOURNAL OF COMBINATORIAL OPTIMIZATION 1382-6905 1573-2886", "ratingType" : { "otype" : "RatingType", "mtid" : 10012, "link" : "/api/ratingtype/10012", "label" : "IX. Gazdaságtudományi Doktori Minősítő Bizottság", "code" : "GMB", "institute" : { "otype" : "Institute", "mtid" : 19066, "link" : "/api/institute/19066", "label" : "Gazdaságtudományi Doktori Minősítő Bizottság IXGJO GMB [1901-]", "childrenCount" : 0, "allowInstForum" : false, "allowOnlineRegistration" : true, "name" : "Gazdaságtudományi Doktori Minősítő Bizottság", "nameEng" : "Gazdaságtudományi Doktori Minősítő Bizottság", "published" : true, "oldId" : 19066, "snippet" : true }, "published" : true, "snippet" : true }, "val" : "B nemzetközi", "published" : false, "snippet" : true }, { "otype" : "SjrRating", "mtid" : 11115321, "link" : "/api/sjrrating/11115321", "label" : "sjr:Q2 (2013) Scopus - Applied Mathematics JOURNAL OF COMBINATORIAL OPTIMIZATION 1382-6905 1573-2886", "listPos" : 208, "rankValue" : 0.49, "type" : "journal", "ratingType" : { "otype" : "RatingType", "mtid" : 10002, "link" : "/api/ratingtype/10002", "label" : "sjr", "code" : "sjr", "published" : true, "snippet" : true }, "subject" : { "otype" : "ClassificationExternal", "mtid" : 2604, "link" : "/api/classificationexternal/2604", "label" : "Scopus - Applied Mathematics", "published" : true, "oldId" : 2604, "snippet" : true }, "ranking" : "Q2", "calculation" : "DIRECT", "published" : true, "snippet" : true } ], "ratingsForSort" : "Q2", "mtaRatingsForSort" : "B nemzetközi", "references" : [ { "otype" : "Reference", "mtid" : 1601705, "link" : "/api/reference/1601705", "label" : "1. Bacsó G, B., New challenges in the theory of hypergraph coloring (2008) Advances in Discrete Mathematics and Applications, 13, pp. 45-57. , Acharya BD et al (eds) Ramanujan Mathematical Society Lecture Notes Series Mysore (2010)", "listPosition" : 1, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 1601706, "link" : "/api/reference/1601706", "label" : "2. Bujtás, C.S., (2008) Algorithms and Structure: Set Partitions under Local Constraints, , PhD Thesis, Information Science& Technology PhD School, University of Pannonia, Hungary", "listPosition" : 2, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 1601707, "link" : "/api/reference/1601707", "label" : "3. Bujtás, C., Tuza, Z., Color-bounded hypergraphs, III: Model comparison (2007) Appl Anal Discr Math, 1, pp. 36-55. , 1246.05053, DOI: 10.2298/AADM0701036B", "listPosition" : 3, "doi" : "10.2298/AADM0701036B", "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 1601708, "link" : "/api/reference/1601708", "label" : "4. Jiang, T., Mubayi, D., Voloshin, V., West, D.B., The chromatic spectrum of mixed hypergraphs (2002) Graphs Combin, 18, pp. 309-318. , 1913672 0994.05063, DOI: 10.1007/s003730200023", "listPosition" : 4, "doi" : "10.1007/s003730200023", "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 1601709, "link" : "/api/reference/1601709", "label" : "5. Lovász, L., Coverings and colorings of hypergraphs (1973) Congr Numer, 8, pp. 3-12", "listPosition" : 5, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 1601710, "link" : "/api/reference/1601710", "label" : "6. Phelps, K.T., Rödl, V., On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (1984) Combinatorica, 4, pp. 79-88. , 739416 0535.68030, DOI: 10.1007/BF02579160", "listPosition" : 6, "doi" : "10.1007/BF02579160", "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 1601711, "link" : "/api/reference/1601711", "label" : "7. Tuza, Z., Voloshin, V.I., Uncolorable mixed hypergraphs (2000) Discr Appl Math, 99, pp. 209-227. , 1743833 0943.05035, DOI: 10.1016/S0166-218X(99)00134-1", "listPosition" : 7, "doi" : "10.1016/S0166-218X(99)00134-1", "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 1601712, "link" : "/api/reference/1601712", "label" : "8. Voloshin, V.I., The mixed hypergraphs (1993) Comput Sci J Moldova, 1, pp. 45-52. , 1252296", "listPosition" : 8, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 1601713, "link" : "/api/reference/1601713", "label" : "9. Voloshin, V.I., On the upper chromatic number of a hypergraph (1995) Australas J Combin, 11, pp. 25-45. , 1327319 0827.05027", "listPosition" : 9, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 1601714, "link" : "/api/reference/1601714", "label" : "10. Voloshin, V.I., (2006) Mixed Hypergraph Coloring Web Site, , http://spectrum.troy.edu/~voloshin/mh.html", "listPosition" : 10, "published" : false, "snippet" : true } ], "hasCitationDuplums" : false, "inSelectedPubs" : "10029944", "userChangeableUntil" : "2014-01-30T21:53:43.000+0000", "publishDate" : "2013-02-12T11:01:37.000+0000", "directInstitutesForSort" : "MTA Rényi Alfréd Matematikai Kutatóintézet; Rendszer- és Számítástudományi Tanszék (PE / MIK)", "ownerAuthorCount" : 2, "ownerInstituteCount" : 24, "directInstituteCount" : 2, "authorCount" : 2, "contributorCount" : 0, "hasQualityFactor" : true, "link" : "/api/publication/2160173", "label" : "Hegyháti M et al. Colorability of mixed hypergraphs and their chromatic inversions. (2013) JOURNAL OF COMBINATORIAL OPTIMIZATION 1382-6905 1573-2886 25 4 737-751", "template" : "