{"id":"https://openalex.org/W4386916508","doi":"https://doi.org/10.37236/11095","title":"Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models","display_name":"Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models","publication_year":2023,"publication_date":"2023-09-21","ids":{"openalex":"https://openalex.org/W4386916508","doi":"https://doi.org/10.37236/11095"},"language":"en","primary_location":{"id":"doi:10.37236/11095","is_oa":true,"landing_page_url":"https://doi.org/10.37236/11095","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i3p33/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":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i3p33/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Utrecht University"],"affiliations":[{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000479623","display_name":"Micha\u0142 Pilipczuk","orcid":"https://orcid.org/0000-0001-7891-1988"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Pilipczuk","raw_affiliation_strings":["University of Warsaw"],"affiliations":[{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055238529","display_name":"Karol W\u0119grzycki","orcid":"https://orcid.org/0000-0001-9746-5733"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karol W\u0119grzycki","raw_affiliation_strings":["Saarland University and Max Planck Institute for Informatics, Saarbr\u00fccken"],"affiliations":[{"raw_affiliation_string":"Saarland University and Max Planck Institute for Informatics, Saarbr\u00fccken","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068357631"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":1.0012,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.83697085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"30","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9783999919891357,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9783999919891357,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11830","display_name":"Point processes and geometric inequalities","score":0.9769999980926514,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9014000296592712,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.869866132736206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7919013500213623},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7874342203140259},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.7858614921569824},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.7622957229614258},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6816228628158569},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5279846787452698},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5215922594070435},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4788670241832733},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35661470890045166},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.05901753902435303}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.869866132736206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7919013500213623},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7874342203140259},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7858614921569824},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7622957229614258},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6816228628158569},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5279846787452698},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5215922594070435},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4788670241832733},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35661470890045166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.05901753902435303},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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":1,"locations":[{"id":"doi:10.37236/11095","is_oa":true,"landing_page_url":"https://doi.org/10.37236/11095","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i3p33/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":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/11095","is_oa":true,"landing_page_url":"https://doi.org/10.37236/11095","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i3p33/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":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2367658155","display_name":"Finding Cracks in the Wall of NP-completeness","funder_award_id":"853234","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G2608529560","display_name":null,"funder_award_id":"850979","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4956428346","display_name":null,"funder_award_id":"Horizon 2020 research and innovatio","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8318064016","display_name":null,"funder_award_id":"Horizon","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8400866838","display_name":"Decomposition methods for discrete problems","funder_award_id":"948057","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320337180","display_name":"Hausdorff Research Institute for Mathematics","ror":null}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4386916508.pdf"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W193449557","https://openalex.org/W1606162993","https://openalex.org/W1815738779","https://openalex.org/W1973674396","https://openalex.org/W2045111615","https://openalex.org/W2143305437","https://openalex.org/W2149573503","https://openalex.org/W2177898499","https://openalex.org/W2333972304","https://openalex.org/W2565975294","https://openalex.org/W2593900191","https://openalex.org/W2755112968","https://openalex.org/W2799268901","https://openalex.org/W2953085759","https://openalex.org/W2962735094","https://openalex.org/W2963177880","https://openalex.org/W2967584293","https://openalex.org/W2978811879","https://openalex.org/W2998163837","https://openalex.org/W3095903540","https://openalex.org/W3129935410","https://openalex.org/W3144518550","https://openalex.org/W3172663538","https://openalex.org/W4285870353","https://openalex.org/W4287250058","https://openalex.org/W4379537724","https://openalex.org/W6735973745","https://openalex.org/W6743144113"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W3216105633","https://openalex.org/W1701875187","https://openalex.org/W2990956612"],"abstract_inverted_index":{"We":[0,36],"study":[1],"Koebe":[2],"orderings":[3,8],"of":[4,18,32,68],"planar":[5,69],"graphs:":[6],"vertex":[7],"obtained":[9],"by":[10,29,49,57,73],"modelling":[11],"the":[12,15,23,27,33,66],"graph":[13,17],"as":[14],"intersection":[16],"pairwise":[19],"internally-disjoint":[20],"discs":[21],"in":[22,62],"plane,":[24],"and":[25,52,86],"ordering":[26,45],"vertices":[28],"non-increasing":[30],"radii":[31],"associated":[34],"discs.":[35],"prove":[37],"that":[38,65],"for":[39],"every":[40],"$d\\in":[41],"\\mathbb{N}$,":[42],"any":[43],"such":[44],"has":[46],"$d$-admissibility":[47,67],"bounded":[48,56,72],"$O(d/\\ln":[50,74],"d)$":[51],"weak":[53],"$d$-coloring":[54],"number":[55],"$O(d^4":[58],"\\ln":[59],"d)$.":[60],"This":[61],"particular":[63],"shows":[64],"graphs":[70],"is":[71],"d)$,":[75],"which":[76],"asymptotically":[77],"matches":[78],"a":[79],"known":[80],"lower":[81],"bound":[82],"due":[83],"to":[84],"Dvo\u0159\u00e1k":[85],"Siebertz.":[87]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}