{"id":"https://openalex.org/W2015399209","doi":"https://doi.org/10.1002/jgt.3190130605","title":"On longest cycles and strongly linking vertex sets","display_name":"On longest cycles and strongly linking vertex sets","publication_year":1989,"publication_date":"1989-12-01","ids":{"openalex":"https://openalex.org/W2015399209","doi":"https://doi.org/10.1002/jgt.3190130605","mag":"2015399209"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190130605","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5072428864","display_name":"Bert Fassbender","orcid":null},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Bert Fassbender","raw_affiliation_strings":["Mathematisches Institut Der Universit\u00e4t zu K\u00f6ln, K\u00f6ln, West Germany"],"affiliations":[{"raw_affiliation_string":"Mathematisches Institut Der Universit\u00e4t zu K\u00f6ln, K\u00f6ln, West Germany","institution_ids":["https://openalex.org/I180923762"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072428864"],"corresponding_institution_ids":["https://openalex.org/I180923762"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760,"provenance":"doaj"},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":53},"biblio":{"volume":"13","issue":"6","first_page":"697","last_page":"702"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.999,"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.999,"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.9989,"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/T12288","display_name":"Optimization and Search Problems","score":0.9955,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/simple-graph","display_name":"Simple graph","score":0.51976246}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8582798},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.84166366},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6846949},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.64672065},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.54885983},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.51976246},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.48840064},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4138105},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39140028},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.051954746},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190130605","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":2,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W2576233014"],"related_works":["https://openalex.org/W755678515","https://openalex.org/W4310825608","https://openalex.org/W4297728441","https://openalex.org/W4205152167","https://openalex.org/W2789801754","https://openalex.org/W2093397072","https://openalex.org/W2078517125","https://openalex.org/W2052299349","https://openalex.org/W2015399209","https://openalex.org/W1901944325"],"abstract_inverted_index":{"Abstract":[0],"Let":[1],"G":[2,15,48],"be":[3,10,20],"a":[4,11,21,26,33],"simple":[5],"non\u2010hamiltonian":[6],"graph,":[7],"let":[8,18],"C":[9,50],"longest":[12],"cycle":[13],"in":[14,47],",":[16],"and":[17],"p":[19,43],"positive":[22],"integer.":[23],"By":[24],"considering":[25],"special":[27],"form":[28],"of":[29,41],"connectivity,":[30],"we":[31],"obtain":[32],"sufficient":[34],"condition":[35],"on":[36],"degrees":[37],"for":[38],"the":[39],"nonexistence":[40],"(":[42],"\u2010":[44,49],"1)\u2010path\u2010connected":[45],"components":[46],".":[51]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2015399209","counts_by_year":[],"updated_date":"2024-12-10T01:31:51.253607","created_date":"2016-06-24"}