{"id":"https://openalex.org/W4414785443","doi":"https://doi.org/10.37236/13317","title":"On the Cop Number of String Graphs","display_name":"On the Cop Number of String Graphs","publication_year":2025,"publication_date":"2025-10-03","ids":{"openalex":"https://openalex.org/W4414785443","doi":"https://doi.org/10.37236/13317"},"language":"en","primary_location":{"id":"doi:10.37236/13317","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13317","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p8/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p8/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077797162","display_name":"Harmender Gahlawat","orcid":"https://orcid.org/0000-0001-7663-6265"},"institutions":[{"id":"https://openalex.org/I4210135941","display_name":"GIFT University","ror":"https://ror.org/04tb22w36","country_code":"PK","type":"education","lineage":["https://openalex.org/I4210135941"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Harmender Gahlawat","raw_affiliation_strings":["Gahlawat"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Gahlawat","institution_ids":["https://openalex.org/I4210135941"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107501376","display_name":"Sandip Das","orcid":"https://orcid.org/0000-0001-7565-8593"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sandip Das","raw_affiliation_strings":["Indian Statistical institute Kolkata, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Statistical institute Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23961661,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9954000115394592,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9954000115394592,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9952999949455261,"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.9918000102043152,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6313999891281128},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.5299999713897705},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.49160000681877136},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.40549999475479126},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3813999891281128},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37540000677108765},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.31139999628067017}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6987000107765198},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6474999785423279},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6313999891281128},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.5299999713897705},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5065000057220459},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.49160000681877136},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.40549999475479126},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3813999891281128},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37540000677108765},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.31139999628067017},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.29409998655319214},{"id":"https://openalex.org/C10325715","wikidata":"https://www.wikidata.org/wiki/Q7835582","display_name":"Trapezoid graph","level":5,"score":0.2937000095844269},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.26460000872612},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.25929999351501465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2574999928474426},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.25290000438690186},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/13317","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13317","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p8/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/13317","is_oa":true,"landing_page_url":"https://doi.org/10.37236/13317","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i4p8/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2098545568","display_name":null,"funder_award_id":"CAP 20-25","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G2744136243","display_name":null,"funder_award_id":"16-\u03bcIDEX-0001","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5574117341","display_name":"Algorithmics of metric covering problems in graphs","funder_award_id":"ANR-21-CE48-0004","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6287694742","display_name":"CAP 20-25","funder_award_id":"ANR-16-IDEX-0001","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414785443.pdf","grobid_xml":"https://content.openalex.org/works/W4414785443.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Cops":[0,128,152,158],"and":[1,56,72,85,94,129,153,159],"Robber":[2,130],"is":[3,29,68,104,222],"a":[4,11,14,27,101,113,135,145,149,196],"well-studied":[5],"two-player":[6],"pursuit-evasion":[7],"game":[8,52],"played":[9],"on":[10,53,132,161,186,201],"graph,":[12],"where":[13],"group":[15],"of":[16,26,33,45,65,87,100,151,168,190,198,205,214],"cops":[17,34,143],"tries":[18],"to":[19,36,78],"capture":[20,37],"the":[21,30,38,51,59,63,97,183,187,202,211],"robber.":[22,39],"The":[23],"cop":[24,60,98,188,203],"number":[25,32,61,99,189,204,213],"graph":[28,103],"minimum":[31],"required":[35],"Gaven\u010diak":[40],"et":[41,170],"al.":[42],"[Eur.":[43],"J.":[44,173],"Comb.":[46,174],"72,":[47],"45-69":[48],"(2018)]":[49],"studied":[50],"intersection":[54],"graphs":[55,67,84,133,216],"established":[57],"that":[58,96,120,141,210],"for":[62,82,126,148],"class":[64],"string":[66,83,88,102,206,215],"at":[69,105,219,223],"most":[70,106,224],"15,":[71],"asked":[73],"as":[74,195],"an":[75,165],"open":[76,166],"question":[77,93,167],"improve":[79,182],"this":[80,92,109,121],"bound":[81],"subclasses":[86],"graphs.":[89,193],"We":[90,117],"address":[91],"establish":[95,119,209],"13.":[107],"To":[108],"end,":[110],"we":[111,139,180,208],"develop":[112],"novel":[114],"guarding":[115],"technique.":[116],"further":[118],"technique":[122],"can":[123],"be":[124],"useful":[125],"other":[127],"games":[131],"admitting":[134],"representation.":[136],"In":[137,178],"particular,":[138],"show":[140],"four":[142],"have":[144],"winning":[146],"strategy":[147],"variant":[150],"Robber,":[154,160],"named":[155],"Fully":[156],"Active":[157],"planar":[162],"graphs,":[163,207],"addressing":[164],"Gromovikov":[169],"al":[171],"[Austr.":[172],"76(2),":[175],"248-265":[176],"(2020)].":[177],"passing,":[179],"also":[181],"known":[184],"bounds":[185],"boxicity":[191],"2":[192],"Finally,":[194],"corollary":[197],"our":[199],"result":[200],"chromatic":[212],"with":[217],"girth":[218],"least":[220],"5":[221],"14.":[225]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}