{"id":"https://openalex.org/W2019761982","doi":"https://doi.org/10.1016/j.jctb.2012.07.005","title":"Claw-free graphs. VII. Quasi-line graphs","display_name":"Claw-free graphs. VII. Quasi-line graphs","publication_year":2012,"publication_date":"2012-09-03","ids":{"openalex":"https://openalex.org/W2019761982","doi":"https://doi.org/10.1016/j.jctb.2012.07.005","mag":"2019761982"},"language":"en","primary_location":{"id":"doi:10.1016/j.jctb.2012.07.005","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.jctb.2012.07.005","pdf_url":null,"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,"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"},"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/A5028345325","display_name":"Maria Chudnovsky","orcid":"https://orcid.org/0000-0002-8920-4944"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maria Chudnovsky","raw_affiliation_strings":["Columbia University, New York, NY 10027, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University, New York, NY 10027, United States","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031948088","display_name":"Paul Seymour","orcid":"https://orcid.org/0000-0003-0067-4534"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul Seymour","raw_affiliation_strings":["Princeton University, Princeton, NJ 08544, United States","Princeton University, Princeton, NJ, 08544, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ 08544, United States","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University, Princeton, NJ, 08544, United States","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3110,"currency":"USD","value_usd":3110},"apc_paid":null,"fwci":3.2365,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.92031838,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"102","issue":"6","first_page":"1267","last_page":"1294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9807999730110168,"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/T10849","display_name":"Finite Group Theory Research","score":0.9782000184059143,"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/chordal-graph","display_name":"Chordal graph","score":0.7682464122772217},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.750441312789917},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.7035561800003052},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.6928964853286743},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.6600144505500793},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.6390545964241028},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.6373010873794556},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.5595455169677734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5567471981048584},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.5157520771026611},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5016922950744629},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.4947344958782196},{"id":"https://openalex.org/keywords/trapezoid-graph","display_name":"Trapezoid graph","score":0.4540998041629791},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.4346347153186798},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.41638270020484924},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41350629925727844},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2650999426841736}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7682464122772217},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.750441312789917},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.7035561800003052},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6928964853286743},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.6600144505500793},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.6390545964241028},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.6373010873794556},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.5595455169677734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5567471981048584},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.5157520771026611},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5016922950744629},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.4947344958782196},{"id":"https://openalex.org/C10325715","wikidata":"https://www.wikidata.org/wiki/Q7835582","display_name":"Trapezoid graph","level":5,"score":0.4540998041629791},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.4346347153186798},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.41638270020484924},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41350629925727844},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2650999426841736}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/j.jctb.2012.07.005","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.jctb.2012.07.005","pdf_url":null,"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,"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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.206","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.206","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.princeton.edu/%7Epds/papers/claws7/paper.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.943.1404","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.943.1404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://web.math.princeton.edu/%7Emchudnov/claws7.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1558167226","https://openalex.org/W1965412489","https://openalex.org/W1997512277","https://openalex.org/W2036700147","https://openalex.org/W2047906133","https://openalex.org/W2137216672","https://openalex.org/W6633470815"],"related_works":["https://openalex.org/W31595256","https://openalex.org/W2293414251","https://openalex.org/W2966902162","https://openalex.org/W1491225866","https://openalex.org/W2008332375","https://openalex.org/W3130332934","https://openalex.org/W2963012349","https://openalex.org/W2004663694","https://openalex.org/W650128082","https://openalex.org/W1912668852"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}