{"id":"https://openalex.org/W2796024344","doi":"https://doi.org/10.1142/s1793830918500441","title":"A new result of list 2-distance coloring of planar graphs with g(G) \u2265 5","display_name":"A new result of list 2-distance coloring of planar graphs with g(G) \u2265 5","publication_year":2018,"publication_date":"2018-04-03","ids":{"openalex":"https://openalex.org/W2796024344","doi":"https://doi.org/10.1142/s1793830918500441","mag":"2796024344"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830918500441","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830918500441","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5083401414","display_name":"Tao Pan","orcid":null},"institutions":[{"id":"https://openalex.org/I28006308","display_name":"Shandong Normal University","ror":"https://ror.org/01wy3h363","country_code":"CN","type":"education","lineage":["https://openalex.org/I28006308"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tao Pan","raw_affiliation_strings":["School of Mathematics and Statistics, Shandong Normal University, Jinan, Shandong 250014, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Shandong Normal University, Jinan, Shandong 250014, P. R. China","institution_ids":["https://openalex.org/I28006308"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100716519","display_name":"Lei Sun","orcid":"https://orcid.org/0000-0002-5050-7630"},"institutions":[{"id":"https://openalex.org/I28006308","display_name":"Shandong Normal University","ror":"https://ror.org/01wy3h363","country_code":"CN","type":"education","lineage":["https://openalex.org/I28006308"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lei Sun","raw_affiliation_strings":["School of Mathematics and Statistics, Shandong Normal University, Jinan, Shandong 250014, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Shandong Normal University, Jinan, Shandong 250014, P. R. China","institution_ids":["https://openalex.org/I28006308"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100716519"],"corresponding_institution_ids":["https://openalex.org/I28006308"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07112189,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"04","first_page":"1850044","last_page":"1850044"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9930999875068665,"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.982200026512146,"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/planar-graph","display_name":"Planar graph","score":0.7842236757278442},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7616595029830933},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6378405690193176},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.5686541795730591},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49957728385925293},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46574223041534424},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.46254393458366394},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.46150830388069153},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.44398295879364014},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.292341947555542},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23463571071624756},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.22199520468711853},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12650996446609497},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.05703899264335632}],"concepts":[{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7842236757278442},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7616595029830933},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6378405690193176},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.5686541795730591},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49957728385925293},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46574223041534424},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.46254393458366394},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.46150830388069153},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.44398295879364014},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.292341947555542},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23463571071624756},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.22199520468711853},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12650996446609497},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.05703899264335632}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830918500441","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830918500441","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1994856976","https://openalex.org/W1995242669","https://openalex.org/W2028038654","https://openalex.org/W2055357224","https://openalex.org/W2067281703","https://openalex.org/W2211464074","https://openalex.org/W2237579535","https://openalex.org/W2554513534"],"related_works":["https://openalex.org/W3216500139","https://openalex.org/W3034858646","https://openalex.org/W4287758186","https://openalex.org/W3135899633","https://openalex.org/W4206287059","https://openalex.org/W4233187590","https://openalex.org/W2002209708","https://openalex.org/W2958281831","https://openalex.org/W2986942805","https://openalex.org/W2963733440"],"abstract_inverted_index":{"It":[0],"was":[1],"proved":[2,51],"in":[3],"[Y.":[4],"Bu":[5],"and":[6,35,61],"C.":[7],"Shang,":[8],"List":[9],"2-distance":[10,43,67],"coloring":[11],"of":[12],"planar":[13,28,55],"graphs":[14],"without":[15],"short":[16],"cycles,":[17],"Discrete":[18],"Math.":[19],"Algorithm.":[20],"Appl.":[21],"8":[22],"(2016)":[23],"1650013]":[24],"that":[25],"for":[26,53],"every":[27,54],"graph":[29,56],"with":[30,57],"girth":[31],"[Formula:":[32,38,44,58,62,68],"see":[33,39,45,59,63,69],"text]":[34,40,60,64],"maximum":[36],"degree":[37],"is":[41,65],"list":[42,66],"text]-colorable.":[46,70],"In":[47],"this":[48],"paper,":[49],"we":[50],"that:":[52]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}