{"id":"https://openalex.org/W2791504812","doi":"https://doi.org/10.1017/s0963548318000068","title":"Distance Colouring Without One Cycle Length","display_name":"Distance Colouring Without One Cycle Length","publication_year":2018,"publication_date":"2018-03-25","ids":{"openalex":"https://openalex.org/W2791504812","doi":"https://doi.org/10.1017/s0963548318000068","mag":"2791504812"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548318000068","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548318000068","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/02F6AF04625109193C7FA9CF1CCD0322/S0963548318000068a.pdf/div-class-title-distance-colouring-without-one-cycle-length-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/02F6AF04625109193C7FA9CF1CCD0322/S0963548318000068a.pdf/div-class-title-distance-colouring-without-one-cycle-length-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"ROSS J. KANG","orcid":null},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"ROSS J. KANG","raw_affiliation_strings":["Department of Mathematics, Radboud University Nijmegen, PO Box 9010, 6500 GL Nijmegen, Netherlands (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Radboud University Nijmegen, PO Box 9010, 6500 GL Nijmegen, Netherlands (e-mail:","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"last","author":{"id":null,"display_name":"FRAN\u00c7OIS PIROT","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"FRAN\u00c7OIS PIROT","raw_affiliation_strings":["LORIA, Campus Scientifique, 615 Rue du Jardin-Botanique, 54506 Vand\u0153uvre-l\u00e8s-Nancy, France (e-mail:"],"affiliations":[{"raw_affiliation_string":"LORIA, Campus Scientifique, 615 Rue du Jardin-Botanique, 54506 Vand\u0153uvre-l\u00e8s-Nancy, France (e-mail:","institution_ids":["https://openalex.org/I4210121838"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145872427"],"apc_list":null,"apc_paid":null,"fwci":2.7974,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.89038101,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"27","issue":"5","first_page":"794","last_page":"807"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.7196000218391418,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.7196000218391418,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.12809999287128448,"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/T11797","display_name":"graph theory and CDMA systems","score":0.039000000804662704,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7080000042915344},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.513700008392334},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47850000858306885},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.46209999918937683},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.3804999887943268},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.3614000082015991}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8363000154495239},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7773000001907349},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7080000042915344},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.513700008392334},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47850000858306885},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.46209999918937683},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4205999970436096},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.3614000082015991},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3359000086784363},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3100999891757965},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.2922999858856201},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.27410000562667847},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.2515000104904175}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548318000068","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548318000068","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/02F6AF04625109193C7FA9CF1CCD0322/S0963548318000068a.pdf/div-class-title-distance-colouring-without-one-cycle-length-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:ru:oai:repository.ubn.ru.nl:2066/197354","is_oa":true,"landing_page_url":"http://hdl.handle.net/2066/197354","pdf_url":"http://hdl.handle.net/2066/197354","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"Combinatorics, Probability and Computing, 27, 794 - 807","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:hal-03007208v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03007208","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Combinatorics, Probability and Computing, 2018, 27 (5), pp.794-807. ⟨10.1017/S0963548318000068⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"doi:10.1017/s0963548318000068","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548318000068","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/02F6AF04625109193C7FA9CF1CCD0322/S0963548318000068a.pdf/div-class-title-distance-colouring-without-one-cycle-length-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8688676036","display_name":null,"funder_award_id":"639.032.614","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2791504812.pdf","grobid_xml":"https://content.openalex.org/works/W2791504812.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1987996179","https://openalex.org/W2018074536","https://openalex.org/W2019898392","https://openalex.org/W2040452405","https://openalex.org/W2048800330","https://openalex.org/W2053777090","https://openalex.org/W2078294311","https://openalex.org/W2167763892","https://openalex.org/W2269072799","https://openalex.org/W4238781763","https://openalex.org/W6664891362"],"related_works":[],"abstract_inverted_index":{"We":[0],"consider":[1],"distance":[2],"colourings":[3],"in":[4],"graphs":[5],"of":[6,18,24,46,121,154,164,175,190],"maximum":[7],"degree":[8],"at":[9,47],"most":[10,48],"d":[11,28,64,73],"and":[12,33,108,166,181,184,192,195,197],"how":[13],"excluding":[14,80,95,133],"one":[15],"fixed":[16],"cycle":[17,83,98,136],"length":[19,84,99,137],"\u2113":[20,85,100,138,165],"affects":[21],"the":[22,68,155],"number":[23],"colours":[25],"required":[26,52,127],"as":[27],"\u2192":[29],"\u221e.":[30],"For":[31,106,149],"vertex-colouring":[32],"t":[34,49,74,88,90,103,109,124,141,150,167],"\u2a7e":[35,86,101,110,139,151],"1,":[36],"if":[37,89,112],"any":[38,113],"two":[39,114],"distinct":[40,115],"vertices":[41],"connected":[42,117],"by":[43,60,79,94,118],"a":[44,58,61,119,145],"path":[45,120],"edges":[50,116,125],"are":[51,126,158,185],"to":[53,128,178,187],"be":[54,77,129,172],"coloured":[55,130],"differently,":[56,131],"then":[57,132],"reduction":[59],"logarithmic":[62,146],"(in":[63],")":[65,75],"factor":[66,147],"against":[67],"trivial":[69],"bound":[70],"O":[71],"(":[72],"can":[76,171],"obtained":[78],"an":[81,96,134],"odd":[82,92],"3":[87],"is":[91,142],"or":[93],"even":[97,135],"2":[102,140],"+":[104],"2.":[105],"edge-colouring":[107],"2,":[111,152],"fewer":[122],"than":[123],"sufficient":[143],"for":[144,160],"reduction.":[148],"neither":[153],"above":[156],"statements":[157],"possible":[159],"other":[161],"parity":[162],"combinations":[163],".":[168],"These":[169],"results":[170,176],"considered":[173],"extensions":[174],"due":[177],"Johansson":[179],"(1996)":[180],"Mahdian":[182],"(2000),":[183],"related":[186],"open":[188],"problems":[189],"Alon":[191],"Mohar":[193],"(2002)":[194],"Kaiser":[196],"Kang":[198],"(2014).":[199]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2018-03-29T00:00:00"}