{"id":"https://openalex.org/W1604434206","doi":"https://doi.org/10.37236/1579","title":"On Planar Mixed Hypergraphs","display_name":"On Planar Mixed Hypergraphs","publication_year":2001,"publication_date":"2001-10-12","ids":{"openalex":"https://openalex.org/W1604434206","doi":"https://doi.org/10.37236/1579","mag":"1604434206"},"language":"en","primary_location":{"id":"doi:10.37236/1579","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1579","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i1r35/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i1r35/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073630443","display_name":"Zden\u0115k Dvo\u0159\u00e1k","orcid":"https://orcid.org/0000-0002-8308-9746"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Zden\u011bk Dvo\u0159\u00e1k","raw_affiliation_strings":["Department of Applied Mathematics Charles University Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25 118 00 Prague, Czech Republic","Institute for Theoretical Computer Science \u2021 Charles University Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25 118 00 Prague, Czech Republic","Department of Applied Mathematics and"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics Charles University Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25 118 00 Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Institute for Theoretical Computer Science \u2021 Charles University Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25 118 00 Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Department of Applied Mathematics and","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027559065","display_name":"Daniel Kr\u00e1l\u034f\u030c","orcid":"https://orcid.org/0000-0001-8680-0890"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Daniel Kr\u00e1l'","raw_affiliation_strings":["Department of Applied Mathematics and","Department of Applied Mathematics Charles University Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25 118 00 Prague, Czech Republic","Institute for Theoretical Computer Science \u2021 Charles University Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25 118 00 Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and","institution_ids":[]},{"raw_affiliation_string":"Department of Applied Mathematics Charles University Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25 118 00 Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Institute for Theoretical Computer Science \u2021 Charles University Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25 118 00 Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":1.7438,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.83461026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9286999702453613,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9286999702453613,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.9221838712692261},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8587132692337036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8469635248184204},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6465659141540527},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.530403733253479},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4902036786079407},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45197153091430664},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.43531113862991333},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.4310925006866455},{"id":"https://openalex.org/keywords/chromatic-polynomial","display_name":"Chromatic polynomial","score":0.42649585008621216},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39267659187316895},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.05489727854728699}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9221838712692261},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8587132692337036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8469635248184204},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6465659141540527},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.530403733253479},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4902036786079407},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45197153091430664},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.43531113862991333},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.4310925006866455},{"id":"https://openalex.org/C126385604","wikidata":"https://www.wikidata.org/wiki/Q1087609","display_name":"Chromatic polynomial","level":3,"score":0.42649585008621216},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39267659187316895},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.05489727854728699},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.37236/1579","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1579","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i1r35/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.21.9816","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.9816","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_8/PDF/v8i1r35.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.22.929","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.929","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_8/PostScriptfiles/v8i1r35.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1579","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1579","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v8i1r35/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1604434206.pdf","grobid_xml":"https://content.openalex.org/works/W1604434206.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W189617261","https://openalex.org/W1524556636","https://openalex.org/W1524736198","https://openalex.org/W1530753374","https://openalex.org/W1543959772","https://openalex.org/W1840491757","https://openalex.org/W1981427797","https://openalex.org/W2011039300","https://openalex.org/W2022564105","https://openalex.org/W2026418225","https://openalex.org/W2054926952","https://openalex.org/W2066577300","https://openalex.org/W2073705438","https://openalex.org/W2087818742","https://openalex.org/W2118970668","https://openalex.org/W2134386654","https://openalex.org/W2137217287","https://openalex.org/W6629416614","https://openalex.org/W6634134318"],"related_works":["https://openalex.org/W1524556636","https://openalex.org/W1988533413","https://openalex.org/W4287332249","https://openalex.org/W3127534791","https://openalex.org/W2994358711","https://openalex.org/W2034116955","https://openalex.org/W2008080870","https://openalex.org/W4300844738","https://openalex.org/W2950815869","https://openalex.org/W2253595186"],"abstract_inverted_index":{"A":[0,33,43,54],"mixed":[1,34,139,163,191,209],"hypergraph":[2,35,44,140,164,192,210],"$H$":[3,58],"is":[4,12,36,45,52,59,98,107,112,123,155,174,199,227],"a":[5,37,91,125,161,178,189,208,232,238,243],"triple":[6],"$(V,{\\cal":[7],"C},{\\cal":[8],"D})$":[9],"where":[10],"$V$":[11],"its":[13,48],"vertex":[14,55],"set":[15,83,101,106,122,135],"and":[16,19,30,72,146],"${\\cal":[17,20,28,31,40,63,74,169],"C}$":[18],"D}$":[21],"are":[22],"families":[23],"of":[24,26,57,84,102,119,136,143,150,171,188,207,246],"subsets":[25],"$V$,":[27],"C}$\u2013edges":[29],"D}$\u2013edges.":[32],"bihypergraph":[38],"iff":[39],"C}={\\cal":[41],"D}$.":[42],"planar":[46,138,162,190,214,233],"if":[47,61,110],"bipartite":[49],"incidence":[50],"graph":[51,236],"planar.":[53],"coloring":[56,93],"proper":[60,92],"each":[62,73],"C}$\u2013edge":[64],"contains":[65,76,237],"two":[66,77,145,168,173],"vertices":[67,78],"with":[68,79,147,165,240],"the":[69,99,104,120,133,184,203,220],"same":[70],"color":[71],"D}$\u2013edge":[75],"different":[80],"colors.":[81],"The":[82,115],"all":[85],"$k$'s":[86],"for":[87,212],"which":[88],"there":[89],"exists":[90],"using":[94],"exactly":[95],"$k$":[96],"colors":[97],"feasible":[100,105,121,134],"$H$;":[103],"called":[108,124],"gap-free":[109],"it":[111,198,226],"an":[113,148],"interval.":[114],"minimum":[116],"(maximum)":[117],"number":[118,187,206,245],"lower":[126,185],"(upper)":[127],"chromatic":[128,186,205],"number.":[129],"We":[130,157,176,195],"prove":[131,159,196,219,224],"that":[132,160,197,225],"any":[137],"without":[141],"edges":[142],"size":[144,151,172],"edge":[149],"at":[152,166,241],"least":[153,242],"four":[154],"gap-free.":[156],"further":[158],"most":[167],"D}$\u2013edges":[170],"two-colorable.":[175],"describe":[177],"polynomial-time":[179],"algorithm":[180],"to":[181,201,218,229],"decide":[182],"whether":[183,231],"equals":[193],"two.":[194],"NP-complete":[200,228],"find":[202],"upper":[204],"even":[211],"3-uniform":[213],"bihypergraphs.":[215],"In":[216],"order":[217],"latter":[221],"statement,":[222],"we":[223],"determine":[230],"3-regular":[234],"bridgeless":[235],"$2$-factor":[239],"given":[244],"components.":[247]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}