{"id":"https://openalex.org/W2406499350","doi":"https://doi.org/10.1090/dimacs/009/08","title":"Planar graph coloring with an uncooperative partner","display_name":"Planar graph coloring with an uncooperative partner","publication_year":1993,"publication_date":"1993-04-29","ids":{"openalex":"https://openalex.org/W2406499350","doi":"https://doi.org/10.1090/dimacs/009/08","mag":"2406499350"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/009/08","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/009/08","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111924906","display_name":"Henry A. Kierste\u00e1d","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Henry Kierstead","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110391140","display_name":"William T. Trotter","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"William Trotter","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.31949686,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"85","last_page":"93"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9490000009536743,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9490000009536743,"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"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9391999840736389,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/T11182","display_name":"Auction Theory and Applications","score":0.9223999977111816,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7465767860412598},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.6348955631256104},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6313415169715881},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5855555534362793},{"id":"https://openalex.org/keywords/windmill-graph","display_name":"Windmill graph","score":0.5462831854820251},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5430457592010498},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5316914319992065},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48792216181755066},{"id":"https://openalex.org/keywords/friendship-graph","display_name":"Friendship graph","score":0.48757404088974},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44886717200279236},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.26070845127105713},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1507459282875061}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7465767860412598},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.6348955631256104},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6313415169715881},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5855555534362793},{"id":"https://openalex.org/C73380178","wikidata":"https://www.wikidata.org/wiki/Q8024306","display_name":"Windmill graph","level":5,"score":0.5462831854820251},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5430457592010498},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5316914319992065},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48792216181755066},{"id":"https://openalex.org/C70488441","wikidata":"https://www.wikidata.org/wiki/Q5504427","display_name":"Friendship graph","level":5,"score":0.48757404088974},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44886717200279236},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.26070845127105713},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1507459282875061},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/dimacs/009/08","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/009/08","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2091414672","https://openalex.org/W2049992750","https://openalex.org/W4290720427","https://openalex.org/W4240570119","https://openalex.org/W2804029448","https://openalex.org/W1526979981","https://openalex.org/W3120282738","https://openalex.org/W2390298591","https://openalex.org/W4239935555","https://openalex.org/W2562183448"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,26],"the":[3,53,72],"game":[4,44,54],"chromatic":[5,45,55],"number":[6,46,56],"of":[7,40,57,64,74],"a":[8,19,33,38,58,85],"planar":[9],"graph":[10,34,59],"is":[11,47,60,69],"at":[12,48],"most":[13,49],"33.":[14],"More":[15],"generally,":[16],"there":[17],"exists":[18],"function":[20],"f:":[21],"f\\l":[22,24],"--+":[23],"so":[25],"for":[27],"each":[28],"n":[29],"E":[30],"f\\l.":[31],"if":[32],"does":[35],"not":[36],"contain":[37],"homeomorph":[39],"Kn\u2022":[41],"then":[42],"its":[43,65],"f(n).":[50],"In":[51],"particular,":[52],"bounded":[61],"in":[62,84],"terms":[63],"genus.":[66],"Our":[67],"proof":[68],"motivated":[70],"by":[71,80],"concept":[73],"p-arrangeability,":[75],"which":[76],"was":[77],"first":[78],"introduced":[79],"Guantao":[81],"and":[82],"Schelp":[83],"Ramsey":[86],"theoretic":[87],"setting.":[88],"\u00a9":[89],"1994":[90],"John":[91],"Wiley":[92],"&":[93],"Sons,":[94],"Inc.":[95]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2025-10-10T00:00:00"}