{"id":"https://openalex.org/W3032974562","doi":"https://doi.org/10.1142/s1793830920500561","title":"Unique chords of unique cycles in 3-connected planar graphs","display_name":"Unique chords of unique cycles in 3-connected planar graphs","publication_year":2020,"publication_date":"2020-06-04","ids":{"openalex":"https://openalex.org/W3032974562","doi":"https://doi.org/10.1142/s1793830920500561","mag":"3032974562"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830920500561","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830920500561","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/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, Ohio 45435, USA"],"raw_orcid":"https://orcid.org/0000-0003-0745-6716","affiliations":[{"raw_affiliation_string":"Department of Mathematics & Statistics, Wright State University, Dayton, Ohio 45435, 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":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09247748,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"04","first_page":"2050056","last_page":"2050056"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9991999864578247,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9822999835014343,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9702000021934509,"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/combinatorics","display_name":"Combinatorics","score":0.7793089151382446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7188221216201782},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5490283966064453},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5263662934303284},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.473473459482193},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4482573866844177},{"id":"https://openalex.org/keywords/chord","display_name":"Chord (peer-to-peer)","score":0.43462464213371277},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4258561134338379},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39020031690597534},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30750221014022827},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16654285788536072}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7793089151382446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7188221216201782},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5490283966064453},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5263662934303284},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.473473459482193},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4482573866844177},{"id":"https://openalex.org/C194147245","wikidata":"https://www.wikidata.org/wiki/Q1076368","display_name":"Chord (peer-to-peer)","level":2,"score":0.43462464213371277},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4258561134338379},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39020031690597534},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30750221014022827},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16654285788536072},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830920500561","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830920500561","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"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/W1579049696","https://openalex.org/W2072057713","https://openalex.org/W2081938755","https://openalex.org/W2509515948","https://openalex.org/W2952096650","https://openalex.org/W2964174375","https://openalex.org/W4210631977"],"related_works":["https://openalex.org/W4385588236","https://openalex.org/W4287117052","https://openalex.org/W31595256","https://openalex.org/W4288422263","https://openalex.org/W4289672287","https://openalex.org/W603403972","https://openalex.org/W2061237693","https://openalex.org/W1554245510","https://openalex.org/W2239518402","https://openalex.org/W4285762950"],"abstract_inverted_index":{"Edges":[0],"that":[1,50],"are":[2,54],"the":[3,20,27,37,77],"unique":[4,38],"chords":[5],"of":[6,17,29,40],"at":[7],"least":[8],"one":[9,42],"cycle":[10],"have":[11],"been":[12],"studied":[13],"by":[14,56],"a":[15],"variety":[16],"authors":[18],"over":[19],"past":[21],"dozen":[22],"years.":[23],"This":[24],"paper":[25],"begins":[26],"study":[28],"those":[30],"graphs":[31,49,71],"in":[32],"which":[33],"each":[34],"edge":[35],"is":[36],"chord":[39],"exactly":[41],"cycle.":[43],"The":[44],"[Formula:":[45,64,73,78,82],"see":[46,65,74,79,83],"text]-connected":[47],"planar":[48],"enjoy":[51],"this":[52],"restriction":[53],"characterized":[55],"two":[57],"infinite":[58],"sequences":[59],"(the":[60,72],"dipyramid":[61],"and":[62,76,81],"trapezohedron":[63],"text]-polytopes)":[66],"together":[67],"with":[68],"three":[69],"special":[70],"text]-antiprism,":[75],"text]-":[80],"text]-prism":[84],"graphs).":[85]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}