{"id":"https://openalex.org/W1963707128","doi":"https://doi.org/10.1016/0095-8956(80)90074-x","title":"On maximal independent sets of vertices in claw-free graphs","display_name":"On maximal independent sets of vertices in claw-free graphs","publication_year":1980,"publication_date":"1980-06-01","ids":{"openalex":"https://openalex.org/W1963707128","doi":"https://doi.org/10.1016/0095-8956(80)90074-x","mag":"1963707128"},"language":"en","primary_location":{"id":"doi:10.1016/0095-8956(80)90074-x","doi":"https://doi.org/10.1016/0095-8956(80)90074-x","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0095-8956(80)90074-x","pdf_url":"https://www.sciencedirect.com/science/article/pii/009589568090074X/pdf","source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-a","jufo-2","norway-2","poland-140","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Theory, Series B","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/009589568090074X/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088620397","display_name":"George J. Minty","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]},{"id":"https://openalex.org/I592451","display_name":"Indiana University","ror":"https://ror.org/01kg8sb98","country_code":"US","type":"education","lineage":["https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"George J Minty","raw_affiliation_strings":["Indiana University\u2217, Bloomington, Indiana 47401, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indiana University\u2217, Bloomington, Indiana 47401, USA","institution_ids":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088620397"],"corresponding_institution_ids":["https://openalex.org/I4210119109","https://openalex.org/I592451"],"apc_list":{"value":4150,"currency":"USD","value_usd":4150},"apc_paid":null,"fwci":13.4479,"has_fulltext":true,"cited_by_count":472,"citation_normalized_percentile":{"value":0.99379336,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"28","issue":"3","first_page":"284","last_page":"304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5849999785423279,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5849999785423279,"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.4138000011444092,"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.00019999999494757503,"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/claw-free-graphs","display_name":"claw-free graphs","score":0.9890000224113464},{"id":"https://openalex.org/keywords/maximal-independent-sets","display_name":"maximal independent sets","score":0.8820000290870667},{"id":"https://openalex.org/keywords/maximum-weighted-independent-set","display_name":"maximum weight independent set","score":0.8420000076293945},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.7549999952316284},{"id":"https://openalex.org/keywords/edge-graphs","display_name":"edge graphs","score":0.6740000247955322}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8437241315841675},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7520698308944702},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.6650034189224243},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.609018087387085},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5512927770614624},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.5194565653800964},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47825658321380615},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.4142623543739319},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.3809701204299927},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37893232703208923},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.22368744015693665},{"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.1016/0095-8956(80)90074-x","doi":"https://doi.org/10.1016/0095-8956(80)90074-x","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0095-8956(80)90074-x","pdf_url":"https://www.sciencedirect.com/science/article/pii/009589568090074X/pdf","source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-a","jufo-2","norway-2","poland-140","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Theory, Series B","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/0095-8956(80)90074-x","doi":"https://doi.org/10.1016/0095-8956(80)90074-x","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0095-8956(80)90074-x","pdf_url":"https://www.sciencedirect.com/science/article/pii/009589568090074X/pdf","source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-a","jufo-2","norway-2","poland-140","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Theory, Series B","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3722715962","display_name":"Problems in Combinatorial Optimization","funder_award_id":"7801893","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322676","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1963707128.pdf","grobid_xml":"https://content.openalex.org/works/W1963707128.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W106814776","https://openalex.org/W1980769375","https://openalex.org/W2001258629","https://openalex.org/W2023290000","https://openalex.org/W2048652909","https://openalex.org/W2059608229","https://openalex.org/W2063410295","https://openalex.org/W2095107575","https://openalex.org/W2327315803","https://openalex.org/W2500775367","https://openalex.org/W2800137643","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W2964197964","https://openalex.org/W64736712","https://openalex.org/W2283362969","https://openalex.org/W4406940083","https://openalex.org/W2140188566","https://openalex.org/W1543196441","https://openalex.org/W2058829003","https://openalex.org/W2548429154","https://openalex.org/W7095108208","https://openalex.org/W3016096504"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":12},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":24},{"year":2020,"cited_by_count":25},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":22},{"year":2017,"cited_by_count":31},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":17}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}