{"id":"https://openalex.org/W2031223899","doi":"https://doi.org/10.1137/120885140","title":"Improper Choosability of Planar Graphs without 4-Cycles","display_name":"Improper Choosability of Planar Graphs without 4-Cycles","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2031223899","doi":"https://doi.org/10.1137/120885140","mag":"2031223899"},"language":"en","primary_location":{"id":"doi:10.1137/120885140","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120885140","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","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/A5036583748","display_name":"Yingqian Wang","orcid":"https://orcid.org/0000-0002-0221-3443"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yingqian Wang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029893283","display_name":"Lingji Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lingji Xu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036583748"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1752,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.87527258,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"27","issue":"4","first_page":"2029","last_page":"2037"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9794999957084656,"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.9794999957084656,"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/T12288","display_name":"Optimization and Search Problems","score":0.9401000142097473,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8540695905685425},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.8181672692298889},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7856196761131287},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5966032147407532},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.568965494632721},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5254516005516052},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4868611693382263},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.48346027731895447},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41605687141418457},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.1208902895450592},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11271092295646667},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.059051692485809326}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8540695905685425},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.8181672692298889},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7856196761131287},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5966032147407532},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.568965494632721},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5254516005516052},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4868611693382263},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.48346027731895447},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41605687141418457},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.1208902895450592},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11271092295646667},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.059051692485809326},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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.1137/120885140","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120885140","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1531267818","https://openalex.org/W1566410171","https://openalex.org/W1656795039","https://openalex.org/W1967561636","https://openalex.org/W1968875166","https://openalex.org/W2009827511","https://openalex.org/W2060875848","https://openalex.org/W2065461360","https://openalex.org/W2074862358","https://openalex.org/W2082129852","https://openalex.org/W2089023036","https://openalex.org/W2093490044","https://openalex.org/W2104261748","https://openalex.org/W2120784503","https://openalex.org/W2145878357","https://openalex.org/W2148360835","https://openalex.org/W2611093227","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3216105633","https://openalex.org/W2990956612","https://openalex.org/W2980093071","https://openalex.org/W4206287059","https://openalex.org/W2967363730","https://openalex.org/W2002209708","https://openalex.org/W1941702003","https://openalex.org/W4233187590","https://openalex.org/W1982166626","https://openalex.org/W2986942805"],"abstract_inverted_index":{"Let":[0],"$k\\ge":[1],"2$":[2],"be":[3,10],"a":[4,11],"positive":[5],"integer,":[6],"and":[7],"let":[8],"$d$":[9,52],"nonnegative":[12],"integer.":[13],"A":[14],"graph":[15,66,88],"$G$":[16,42,48],"is":[17,61,78,94,97],"$d$-improperly":[18],"$k$-choosable,":[19],"or":[20],"simply,":[21],"$(k,d)$-choosable":[22],"if,":[23],"for":[24,32,75],"every":[25,33,64,86],"list":[26],"assignment":[27],"$L$":[28],"with":[29,67],"$|L(v)|\\geq":[30],"k$":[31],"$v\\in":[34],"V":[35],"(G)$,":[36],"there":[37,106,118],"exists":[38],"an":[39],"$L$-coloring":[40],"of":[41,47,69,91],"such":[43],"that":[44,63,85],"each":[45],"vertex":[46],"has":[49],"at":[50],"most":[51],"neighbors":[53],"colored":[54],"the":[55,101],"same":[56],"color":[57],"as":[58],"itself.":[59],"It":[60],"known":[62],"planar":[65,87,108,120],"cycles":[68,90],"length":[70,92],"neither":[71],"4":[72,93],"nor":[73],"$k$":[74],"some":[76],"$k\\in\\{5,6,7,8,9\\}$":[77],"$(3,1)$-choosable.":[79,95],"In":[80],"this":[81],"paper,":[82],"we":[83],"prove":[84],"without":[89,122],"This":[96],"best":[98],"possible":[99],"in":[100],"following":[102],"two":[103],"senses:":[104],"(i)":[105],"are":[107,111,119,125],"graphs":[109,121],"which":[110,124],"not":[112,115,126,129],"$(3,1)$-colorable,":[113],"hence":[114,128],"$(3,1)$-choosable;":[116],"(ii)":[117],"4-cycles":[123],"$(3,0)$-colorable,":[127],"$(3,0)$-choosable.":[130]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}