{"id":"https://openalex.org/W4401398485","doi":"https://doi.org/10.1007/s00373-024-02823-3","title":"Maximal Colourings for Graphs","display_name":"Maximal Colourings for Graphs","publication_year":2024,"publication_date":"2024-08-07","ids":{"openalex":"https://openalex.org/W4401398485","doi":"https://doi.org/10.1007/s00373-024-02823-3"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-024-02823-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00373-024-02823-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00373-024-02823-3.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00373-024-02823-3.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053600659","display_name":"Raffaella Mulas","orcid":"https://orcid.org/0000-0003-4995-6479"},"institutions":[{"id":"https://openalex.org/I4210091327","display_name":"Max Planck Institute for Mathematics in the Sciences","ror":"https://ror.org/00ez2he07","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210091327"]},{"id":"https://openalex.org/I4210119712","display_name":"Max Planck Institute for Mathematics","ror":"https://ror.org/02dh8ja68","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210119712"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["DE","NL"],"is_corresponding":true,"raw_author_name":"Raffaella Mulas","raw_affiliation_strings":["Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany","Vrije Universiteit Amsterdam, Amsterdam, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-4995-6479","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany","institution_ids":["https://openalex.org/I4210119712","https://openalex.org/I4210091327"]},{"raw_affiliation_string":"Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5053600659"],"corresponding_institution_ids":["https://openalex.org/I4210091327","https://openalex.org/I4210119712","https://openalex.org/I865915315"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.3457,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61715085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"40","issue":"5","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9919000267982483,"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.9919000267982483,"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.98580002784729,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9320999979972839,"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.7884445190429688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7711925506591797},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4112062454223633}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7884445190429688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7711925506591797},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4112062454223633}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00373-024-02823-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00373-024-02823-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00373-024-02823-3.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/90925abf-2b1b-40d0-8005-58998f8be923","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/90925abf-2b1b-40d0-8005-58998f8be923","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mulas, R 2024, 'Maximal Colourings for Graphs', Graphs and Combinatorics, vol. 40, no. 5, 93, pp. 1-16. https://doi.org/10.1007/s00373-024-02823-3","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:research.vu.nl:openaire/90925abf-2b1b-40d0-8005-58998f8be923","is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/90925abf-2b1b-40d0-8005-58998f8be923","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mulas, R 2024, 'Maximal Colourings for Graphs', Graphs and Combinatorics, vol. 40, no. 5, 93, pp. 1-16. https://doi.org/10.1007/s00373-024-02823-3","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s00373-024-02823-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00373-024-02823-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00373-024-02823-3.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4401398485.pdf","grobid_xml":"https://content.openalex.org/works/W4401398485.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W262788691","https://openalex.org/W1500067272","https://openalex.org/W1515697879","https://openalex.org/W1987996179","https://openalex.org/W2024514015","https://openalex.org/W2026276110","https://openalex.org/W2041714893","https://openalex.org/W2058526570","https://openalex.org/W2070103376","https://openalex.org/W2142193905","https://openalex.org/W2461440336","https://openalex.org/W2601954554","https://openalex.org/W2898325455","https://openalex.org/W2905338031","https://openalex.org/W2954348559","https://openalex.org/W2962671664","https://openalex.org/W2982703414","https://openalex.org/W3022304398","https://openalex.org/W3111741227","https://openalex.org/W3128477922","https://openalex.org/W3161154348","https://openalex.org/W3189857526","https://openalex.org/W4212954719","https://openalex.org/W4251636534","https://openalex.org/W4379622189","https://openalex.org/W4387818363","https://openalex.org/W6821556336"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W4238204885"],"abstract_inverted_index":{"Abstract":[0],"We":[1,69],"consider":[2],"two":[3,51,73],"different":[4],"notions":[5],"of":[6,41,44,49,67],"graph":[7],"colouring,":[8],"namely,":[9],"the":[10,27,39,55,64],"t":[11],"-periodic":[12],"colouring":[13,29,57,75],"for":[14,30],"vertices":[15],"that":[16,33,82],"has":[17,34],"been":[18,35],"introduced":[19,37],"in":[20,38],"1974":[21],"by":[22,62],"Bondy":[23],"and":[24,26,78],"Simonovits,":[25],"periodic":[28],"oriented":[31],"edges":[32],"recently":[36],"context":[40],"spectral":[42],"theory":[43],"non-backtracking":[45],"operators.":[46],"For":[47],"each":[48],"these":[50,72],"colourings,":[52],"we":[53,79],"introduce":[54],"corresponding":[56],"number":[58,66],"which":[59],"is":[60,84],"given":[61],"maximising":[63],"possible":[65],"colours.":[68],"first":[70],"investigate":[71],"new":[74],"numbers":[76],"individually,":[77],"then":[80],"show":[81],"there":[83],"a":[85],"deep":[86],"relationship":[87],"between":[88],"them.":[89]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-08T06:56:09.383167","created_date":"2025-10-10T00:00:00"}