{"id":"https://openalex.org/W7204136602","doi":"https://doi.org/10.1002/jgt.70120","title":"A Note on Lov\u00e1sz Characterization of Perfect Graphs","display_name":"A Note on Lov\u00e1sz Characterization of Perfect Graphs","publication_year":2026,"publication_date":"2026-08-24","ids":{"openalex":"https://openalex.org/W7204136602","doi":"https://doi.org/10.1002/jgt.70120"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.70120","doi":"https://doi.org/10.1002/jgt.70120","is_oa":true,"landing_page_url":"https://doi.org/10.1002/jgt.70120","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/jgt.70120","source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/jgt.70120","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027190366","display_name":"James Alex","orcid":"https://orcid.org/0000-0001-5431-8020","observed_orcids":["https://orcid.org/0000-0001-5431-8020"]},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"James Alex","raw_affiliation_strings":["School of Electrical Engineering, Computing and Mathematical Sciences Curtin University Perth Western Australia Australia"],"raw_orcid":"https://orcid.org/0000-0001-5431-8020","affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Computing and Mathematical Sciences Curtin University Perth Western Australia Australia","institution_ids":["https://openalex.org/I205640436"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5027190366"],"corresponding_institution_ids":["https://openalex.org/I205640436"],"apc_list":{"value":4150,"currency":"USD","value_usd":4150},"apc_paid":{"value":4150,"currency":"USD","value_usd":4150},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.68948293,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"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.9990000128746033,"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.9990000128746033,"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.000699999975040555,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":9.999999747378752e-05,"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/perfect-graphs","display_name":"perfect graphs","score":0.9980000257492065},{"id":"https://openalex.org/keywords/chromatic-number","display_name":"chromatic number","score":0.7839999794960022},{"id":"https://openalex.org/keywords/clique-number","display_name":"clique number","score":0.906000018119812},{"id":"https://openalex.org/keywords/independent-sets","display_name":"independent sets","score":0.7429999709129333},{"id":"https://openalex.org/keywords/alternative-proof","display_name":"alternative proof","score":0.6830000281333923},{"id":"https://openalex.org/keywords/induced-subgraphs","display_name":"induced subgraphs","score":0.7059999704360962}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.800599992275238},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7768999934196472},{"id":"https://openalex.org/C170903109","wikidata":"https://www.wikidata.org/wiki/Q7844666","display_name":"Trivially perfect graph","level":5,"score":0.6708999872207642},{"id":"https://openalex.org/C161487630","wikidata":"https://www.wikidata.org/wiki/Q2800071","display_name":"Perfect graph theorem","level":5,"score":0.6044999957084656},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5911999940872192},{"id":"https://openalex.org/C32972407","wikidata":"https://www.wikidata.org/wiki/Q1187620","display_name":"Perfect graph","level":5,"score":0.5527999997138977},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5052000284194946},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.45809999108314514},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.44670000672340393},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4221999943256378},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.38019999861717224},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.37209999561309814},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.32679998874664307},{"id":"https://openalex.org/C2985491264","wikidata":"https://www.wikidata.org/wiki/Q761631","display_name":"Clique number","level":3,"score":0.32420000433921814},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.32030001282691956},{"id":"https://openalex.org/C93446932","wikidata":"https://www.wikidata.org/wiki/Q1972803","display_name":"Perfect power","level":2,"score":0.3172999918460846},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.30329999327659607},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3012999892234802},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2597000002861023},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.25760000944137573}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.70120","doi":"https://doi.org/10.1002/jgt.70120","is_oa":true,"landing_page_url":"https://doi.org/10.1002/jgt.70120","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/jgt.70120","source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1002/jgt.70120","doi":"https://doi.org/10.1002/jgt.70120","is_oa":true,"landing_page_url":"https://doi.org/10.1002/jgt.70120","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/jgt.70120","source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"id":"https://metadata.un.org/sdg/10","score":0.4625835716724396,"display_name":"Reduced inequalities"}],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320987","display_name":"Curtin University of Technology","ror":"https://ror.org/02n415q13"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7204136602.pdf","grobid_xml":"https://content.openalex.org/works/W7204136602.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1973199140","https://openalex.org/W1994985997","https://openalex.org/W1997998268","https://openalex.org/W2065306274","https://openalex.org/W2076086747","https://openalex.org/W2076193235","https://openalex.org/W2995423599","https://openalex.org/W3009038700","https://openalex.org/W4393411922","https://openalex.org/W7133510271"],"related_works":[],"abstract_inverted_index":{"ABSTRACT":[0],"A":[1],"graph":[2,33],"is":[3,34,61],"perfect":[4,28,35],"if,":[5,39],"for":[6,40],"every":[7,41],"induced":[8,42],"subgraph,":[9,43],"the":[10,14,44,47,50,55,58,64,72,101,107],"chromatic":[11],"number":[12,65],"equals":[13],"size":[15,48,56],"of":[16,27,46,49,57,66,74,85,109],"its":[17],"largest":[18,51,59],"clique.":[19],"In":[20,77],"1972,":[21],"Lov\u00e1sz":[22],"established":[23],"a":[24,32,112],"fundamental":[25],"characterization":[26],"graphs,":[29,111],"showing":[30],"that":[31,88],"if":[36],"and":[37,54],"only":[38],"product":[45],"independent":[52],"set":[53],"clique":[60],"at":[62],"least":[63],"vertices.":[67],"His":[68],"proof":[69,84],"relied":[70],"on":[71],"technique":[73],"vertex":[75,90,93],"replication.":[76,91],"this":[78],"paper,":[79],"we":[80],"present":[81],"an":[82],"alternative":[83],"Lov\u00e1sz's":[86],"result":[87],"avoids":[89],"As":[92],"replication":[94],"does":[95],"not":[96],"in":[97,117],"general":[98],"preserve":[99],"\u2010perfection,":[100],"argument":[102],"developed":[103],"here":[104],"applies":[105],"to":[106],"study":[108],"\u2010perfect":[110],"class":[113],"introduced":[114],"by":[115],"Ravindra":[116],"2011.":[118]},"counts_by_year":[],"updated_date":"2026-09-25T08:18:29.962427","created_date":"2026-08-25T00:00:00"}