{"headerData":{"lastRefreshDate":"06 Jul 2026"},"publicationOverview":{"publication":{"id":"B943E7E6-1100-4362-9FF1-2C62911BEC16","resourceUrl":"http://gtr.ukri.org/api/publication/overview?outcomeid=doi_53d00c00c8eea5e9&projectref=#grantRef#","outcomeId":"doi_53d00c00c8eea5e9","title":"Determining the chromatic number of triangle-free 2 P 3 -free graphs in polynomial time","parentPublicationTitle":"Theoretical Computer Science","authors":[{"id":"4edda31aeae216a266ac4d00716ef04f","resourceUrl":"http://gtr.ukri.org/api/person/4edda31aeae216a266ac4d00716ef04f","firstName":null,"otherNames":"Broersma H","surname":null,"email":null,"orcidId":null,"displayName":"Broersma H","fullName":"Broersma H"}],"date":1325376000000,"digitalPublicationUrl":"http://dx.doi.org/10.1016/j.tcs.2011.12.076","pubMedId":null,"pubMedUrl":null,"isbn":null,"issn":null,"publicationUrl":"http://dx.doi.org/10.1016/j.tcs.2011.12.076","abstractText":null,"volume":null,"issue":null,"totalPages":null,"edition":null,"chapterNumber":null,"chapterTitle":null,"pageRef":null,"series":null,"type":"Journal Article/Review","firstAuthorName":"Broersma H","grantRef":null},"projects":[{"id":"4A664E23-28AC-41E8-B12F-76543CFDDF6E","resourceUrl":"http://gtr.ukri.org/projects?ref=EP/G043434/1","title":"Algorithmic Aspects of Graph Coloring","status":null,"grantReference":"EP/G043434/1","grantCategory":"Research Grant","abstractText":null,"potentialImpactText":null,"fund":{"valuePounds":437513,"start":null,"end":null,"funder":{"id":"798CB33D-C79E-4578-83F2-72606407192C","resourceUrl":"http://gtr.ukri.org/api/organisation/798CB33D-C79E-4578-83F2-72606407192C","name":"EPSRC"},"type":"INCOME_ACTUAL"},"output":null,"publications":null,"identifiers":null,"technicalSummary":null,"projectHierarchy":null,"studentshipHierarchy":null,"healthCategories":[],"researchActivities":[],"researchSubjects":[],"researchTopics":[],"rcukProgrammes":[],"hasClassifications":false}],"abstractSnippet":null}}