{"id":"https://openalex.org/W3095012521","doi":"https://doi.org/10.1080/09728600.2020.1832873","title":"Graphs in which every <i>c</i> edges that form a tree are chords of a common cycle","display_name":"Graphs in which every <i>c</i> edges that form a tree are chords of a common cycle","publication_year":2020,"publication_date":"2020-05-03","ids":{"openalex":"https://openalex.org/W3095012521","doi":"https://doi.org/10.1080/09728600.2020.1832873","mag":"3095012521"},"language":"en","primary_location":{"id":"doi:10.1080/09728600.2020.1832873","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2020.1832873","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/09728600.2020.1832873?needAccess=true","source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/09728600.2020.1832873?needAccess=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018454433","display_name":"Terry A. McKee","orcid":"https://orcid.org/0000-0003-0745-6716"},"institutions":[{"id":"https://openalex.org/I19648265","display_name":"Wright State University","ror":"https://ror.org/04qk6pt94","country_code":"US","type":"education","lineage":["https://openalex.org/I19648265"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Terry A. McKee","raw_affiliation_strings":["Department of Mathematics & Statistics, Wright State University, Dayton, OH, USA"],"raw_orcid":"https://orcid.org/0000-0003-0745-6716","affiliations":[{"raw_affiliation_string":"Department of Mathematics & Statistics, Wright State University, Dayton, OH, USA","institution_ids":["https://openalex.org/I19648265"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018454433"],"corresponding_institution_ids":["https://openalex.org/I19648265"],"apc_list":{"value":1000,"currency":"GBP","value_usd":1226},"apc_paid":{"value":1000,"currency":"GBP","value_usd":1226},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18666037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"2","first_page":"670","last_page":"672"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9969000220298767,"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/mathematics","display_name":"Mathematics","score":0.8021185398101807},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7845571041107178},{"id":"https://openalex.org/keywords/social-connectedness","display_name":"Social connectedness","score":0.7568010091781616},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.5454484224319458},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45553824305534363},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.42374187707901},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.41394326090812683},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36796998977661133},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2710385322570801},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.06445890665054321}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8021185398101807},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7845571041107178},{"id":"https://openalex.org/C201943243","wikidata":"https://www.wikidata.org/wiki/Q7551008","display_name":"Social connectedness","level":2,"score":0.7568010091781616},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5454484224319458},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45553824305534363},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.42374187707901},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.41394326090812683},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36796998977661133},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2710385322570801},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.06445890665054321},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/09728600.2020.1832873","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2020.1832873","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/09728600.2020.1832873?needAccess=true","source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:0a08ba243908441c83a54461b22d65d6","is_oa":true,"landing_page_url":"https://doaj.org/article/0a08ba243908441c83a54461b22d65d6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 2, Pp 670-672 (2020)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1080/09728600.2020.1832873","is_oa":true,"landing_page_url":"https://doi.org/10.1080/09728600.2020.1832873","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/09728600.2020.1832873?needAccess=true","source":{"id":"https://openalex.org/S2764899362","display_name":"AKCE International Journal of Graphs and Combinatorics","issn_l":"0972-8600","issn":["0972-8600","2543-3474"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"AKCE International Journal of Graphs and Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3095012521.pdf"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W1579049696","https://openalex.org/W1971934455","https://openalex.org/W1997694581","https://openalex.org/W2064702321","https://openalex.org/W2741088109"],"related_works":["https://openalex.org/W3125761283","https://openalex.org/W2164081328","https://openalex.org/W1976722080","https://openalex.org/W3092556108","https://openalex.org/W2117372696","https://openalex.org/W3152831473","https://openalex.org/W3044931971","https://openalex.org/W1995672666","https://openalex.org/W3008541637","https://openalex.org/W2078521380"],"abstract_inverted_index":{"Consider":[0],"the":[1,48,51],"k-connected":[2],"graphs":[3],"G":[4],"in":[5],"which":[6],"every":[7],"c":[8,41],"\u2265":[9],"1":[10],"edges":[11],"that":[12,85],"form":[13],"a":[14,25,31,73,78],"particular":[15],"type":[16,53],"of":[17,24,28,50,54,75],"induced":[18,55],"subgraph":[19],"must":[20],"all":[21],"be":[22],"chords":[23],"common":[26,66],"cycle":[27],"G.":[29],"Extending":[30],"few":[32],"known":[33],"partial":[34],"results":[35,46,71],"with":[36,57],"k":[37],"\u2264":[38,42],"3":[39],"and":[40,83],"2":[43],",":[44],"new":[45,70],"exploit":[47],"structure":[49],"specified":[52],"subgraph,":[56],"considerable":[58],"success":[59],"when":[60],"those":[61],"subgraphs":[62],"are":[63],"trees.":[64],"The":[65],"tool":[67],"behind":[68],"these":[69],"is":[72],"property":[74],"k-connectedness":[76],"from":[77],"2001":[79],"paper":[80,90],"by":[81],"Denley":[82],"Wu":[84],"generalized":[86],"Dirac\u2019s":[87],"fundamental":[88],"1960":[89],"on":[91],"connectivity.":[92]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}