{"id":"https://openalex.org/W1976120600","doi":"https://doi.org/10.1142/s0129054100000260","title":"ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES","display_name":"ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES","publication_year":2000,"publication_date":"2000-09-01","ids":{"openalex":"https://openalex.org/W1976120600","doi":"https://doi.org/10.1142/s0129054100000260","mag":"1976120600"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054100000260","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054100000260","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5007741379","display_name":"Martin Charles Golumbic","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"MARTIN CHARLES GOLUMBIC","raw_affiliation_strings":["Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan, Israel","Department of Mathematics and Computer Science, Bar-Ilan University, Ramat Gan, Israel#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan, Israel","institution_ids":["https://openalex.org/I13955877"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Bar-Ilan University, Ramat Gan, Israel#TAB#","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069504394","display_name":"Udi Rotics","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"UDI ROTICS","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G4, Canada","Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G4, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G4, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G4, Canada#TAB#","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.051,"has_fulltext":false,"cited_by_count":231,"citation_normalized_percentile":{"value":0.96632821,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"11","issue":"03","first_page":"423","last_page":"443"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9977999925613403,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9959999918937683,"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.8676767349243164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7434278726577759},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5574058294296265},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.5542593598365784},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5371938347816467},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.5068746209144592},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5064338445663452},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4582783877849579},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.44875651597976685},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4243192672729492},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36705800890922546},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.27410879731178284},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2271149456501007},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.19372019171714783},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.19089823961257935}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8676767349243164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7434278726577759},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5574058294296265},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.5542593598365784},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5371938347816467},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.5068746209144592},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5064338445663452},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4582783877849579},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.44875651597976685},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4243192672729492},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36705800890922546},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.27410879731178284},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2271149456501007},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.19372019171714783},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.19089823961257935},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054100000260","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054100000260","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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":15,"referenced_works":["https://openalex.org/W1603515798","https://openalex.org/W1835083164","https://openalex.org/W1981303423","https://openalex.org/W1981356557","https://openalex.org/W1989214692","https://openalex.org/W1992797912","https://openalex.org/W1993328543","https://openalex.org/W1994706865","https://openalex.org/W1994887153","https://openalex.org/W2022499468","https://openalex.org/W2053991811","https://openalex.org/W2059518216","https://openalex.org/W2109716789","https://openalex.org/W2143474538","https://openalex.org/W4240389170"],"related_works":["https://openalex.org/W2186006531","https://openalex.org/W4315881088","https://openalex.org/W2079220110","https://openalex.org/W2936075899","https://openalex.org/W2085548552","https://openalex.org/W2293414251","https://openalex.org/W1614693244","https://openalex.org/W1977623074","https://openalex.org/W3003390052","https://openalex.org/W1976120600"],"abstract_inverted_index":{"Graphs":[0],"of":[1,38,76,84,116,134],"clique\u2013width":[2,37,52,118,140,146,164],"at":[3,53,120],"most":[4,54],"k":[5,28],"were":[6],"introduced":[7],"by":[8,20],"Courcelle,":[9],"Engelfriet":[10],"and":[11,56,79,105,143],"Rozenberg":[12],"(1993)":[13],"as":[14],"graphs":[15,81,136],"which":[16,26],"can":[17,61],"be":[18,62],"defined":[19],"k-expressions":[21],"based":[22],"on":[23],"graph":[24,40,102,108],"operations":[25],"use":[27],"vertex":[29],"labels.":[30],"In":[31],"this":[32],"paper":[33],"we":[34,45,71,89,150],"study":[35],"the":[36,68,74,129,132],"perfect":[39,135],"classes.":[41],"On":[42,67],"one":[43],"hand,":[44,70],"show":[46,72,90,151],"that":[47,73,91,152],"every":[48,93,153],"distance\u2013hereditary":[49],"graph,":[50],"has":[51,163],"3,":[55,162],"a":[57,99,106],"3\u2013expression":[58],"defining":[59],"it":[60],"obtained":[63],"in":[64],"linear":[65],"time.":[66],"other":[69],"classes":[75,138,144],"unit":[77,100],"interval":[78,101],"permutation":[80,107],"are":[82],"not":[83],"bounded":[85,142],"clique\u2013width.":[86],"More":[87],"precisely,":[88],"for":[92],"[Formula:":[94,157],"see":[95,128,158],"text]":[96],"there":[97],"is":[98,119,141,147],"I":[103],"n":[104,110,112,160],"H":[109],"having":[111],"2":[113],"vertices,":[114],"each":[115],"whose":[117,139,145],"least":[121],"n.":[122],"These":[123],"results":[124],"allow":[125],"us":[126],"to":[127],"border":[130],"within":[131],"hierarchy":[133],"between":[137],"unbounded.":[148],"Finally":[149],"n\u00d7n":[154],"square":[155],"grid,":[156],"text],":[159],"\u2265":[161],"exactly":[165],"n+1.":[166]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":8}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}