{"id":"https://openalex.org/W3046672072","doi":"https://doi.org/10.1007/s00373-020-02215-3","title":"An Infinite Family of Sum-Paint Critical Graphs","display_name":"An Infinite Family of Sum-Paint Critical Graphs","publication_year":2020,"publication_date":"2020-08-01","ids":{"openalex":"https://openalex.org/W3046672072","doi":"https://doi.org/10.1007/s00373-020-02215-3","mag":"3046672072"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-020-02215-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-020-02215-3","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","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/A5073136526","display_name":"Thomas A. Mahoney","orcid":"https://orcid.org/0000-0002-7401-8727"},"institutions":[{"id":"https://openalex.org/I93131583","display_name":"Emporia State University","ror":"https://ror.org/04e6r1478","country_code":"US","type":"education","lineage":["https://openalex.org/I93131583"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Thomas Mahoney","raw_affiliation_strings":["Emporia State University, Emporia, KS, USA"],"affiliations":[{"raw_affiliation_string":"Emporia State University, Emporia, KS, USA","institution_ids":["https://openalex.org/I93131583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045523567","display_name":"Chad Wiley","orcid":null},"institutions":[{"id":"https://openalex.org/I93131583","display_name":"Emporia State University","ror":"https://ror.org/04e6r1478","country_code":"US","type":"education","lineage":["https://openalex.org/I93131583"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chad Wiley","raw_affiliation_strings":["Emporia State University, Emporia, KS, USA"],"affiliations":[{"raw_affiliation_string":"Emporia State University, Emporia, KS, USA","institution_ids":["https://openalex.org/I93131583"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073136526"],"corresponding_institution_ids":["https://openalex.org/I93131583"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12809807,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":"5","first_page":"1563","last_page":"1571"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9972000122070312,"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.9972000122070312,"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.9861999750137329,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9778000116348267,"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.9167644381523132},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.639314591884613},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6334146857261658},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5968331694602966},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5821858048439026},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5016703605651855},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4315493404865265},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.42209121584892273},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4169853627681732},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.19436931610107422},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11943721771240234},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10932284593582153}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9167644381523132},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.639314591884613},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6334146857261658},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5968331694602966},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5821858048439026},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5016703605651855},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4315493404865265},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.42209121584892273},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4169853627681732},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.19436931610107422},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11943721771240234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10932284593582153}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00373-020-02215-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-020-02215-3","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1484873880","https://openalex.org/W1515228725","https://openalex.org/W1587621605","https://openalex.org/W1598828859","https://openalex.org/W1964362533","https://openalex.org/W2077074612","https://openalex.org/W2103275490","https://openalex.org/W2130209831","https://openalex.org/W2767599137","https://openalex.org/W2993985424","https://openalex.org/W2998755151","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W4321206936","https://openalex.org/W69005189","https://openalex.org/W4296234383","https://openalex.org/W1527284691","https://openalex.org/W1673659200"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}