{"id":"https://openalex.org/W2013355237","doi":"https://doi.org/10.1137/11084933x","title":"Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It","display_name":"Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2013355237","doi":"https://doi.org/10.1137/11084933x","mag":"2013355237"},"language":"en","primary_location":{"id":"doi:10.1137/11084933x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11084933x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1309.1841","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Pierre Aboulker","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pierre Aboulker","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Marko Radovanovi\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marko Radovanovi\u0107","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Nicolas Trotignon","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicolas Trotignon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Kristina Vu\u0161kovi\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kristina Vu\u0161kovi\u0107","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4298,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.88699786,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"26","issue":"4","first_page":"1510","last_page":"1531"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9585999846458435,"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.9585999846458435,"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.012900000438094139,"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":0.011900000274181366,"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/node","display_name":"Node (physics)","score":0.6333000063896179},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6067000031471252},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.5472999811172485},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5019000172615051},{"id":"https://openalex.org/keywords/analogy","display_name":"Analogy","score":0.492000013589859},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.3822999894618988},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.3400000035762787}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7210000157356262},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6890000104904175},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6333000063896179},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6067000031471252},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5472999811172485},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5045999884605408},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5019000172615051},{"id":"https://openalex.org/C521332185","wikidata":"https://www.wikidata.org/wiki/Q185816","display_name":"Analogy","level":2,"score":0.492000013589859},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.3822999894618988},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.3400000035762787},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3221000134944916},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3075000047683716},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29249998927116394},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.288100004196167},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2752000093460083},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.274399995803833},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.2606000006198883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.25429999828338623}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/11084933x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11084933x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1309.1841","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1309.1841","pdf_url":"https://arxiv.org/pdf/1309.1841","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1309.1841","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1309.1841","pdf_url":"https://arxiv.org/pdf/1309.1841","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7745595251","display_name":null,"funder_award_id":"ANR-10-JCJC-0204","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G8833309705","display_name":null,"funder_award_id":"EP/H021426/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1966382509","https://openalex.org/W1973199140","https://openalex.org/W1987920422","https://openalex.org/W1991728994","https://openalex.org/W1994556169","https://openalex.org/W1996575062","https://openalex.org/W1996804679","https://openalex.org/W2002055996","https://openalex.org/W2047194922","https://openalex.org/W2060685279","https://openalex.org/W2067458708","https://openalex.org/W2104062785","https://openalex.org/W2118382442","https://openalex.org/W2142675075","https://openalex.org/W2528053456","https://openalex.org/W2952096650","https://openalex.org/W4291166258"],"related_works":[],"abstract_inverted_index":{"We":[0],"recall":[1],"several":[2],"known":[3],"results":[4],"about":[5],"minimally":[6],"2-connected":[7,25],"graphs":[8,35],"and":[9,43,74,80],"show":[10],"that":[11,36,53],"they":[12],"all":[13],"follow":[14],"from":[15,20],"a":[16,41,48,51],"decomposition":[17],"theorem.":[18],"Starting":[19],"an":[21,45],"analogy":[22],"with":[23,50],"critically":[24],"graphs,":[26],"we":[27,65],"give":[28],"structural":[29],"characterizations":[30,64],"of":[31,34],"the":[32,60],"classes":[33,73],"do":[37],"not":[38],"contain":[39],"as":[40,44],"subgraph":[42],"induced":[46],"subgraph,":[47],"cycle":[49],"node":[52],"has":[54],"at":[55],"least":[56],"two":[57],"neighbors":[58],"on":[59],"cycle.":[61],"From":[62],"these":[63,72],"get":[66],"polynomial":[67,75],"time":[68,76],"recognition":[69],"algorithms":[70,77],"for":[71,78],"vertex-coloring":[79],"edge-coloring.":[81]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-20T22:02:38.213706","created_date":"2016-06-24T00:00:00"}