{"id":"https://openalex.org/W4416273832","doi":"https://doi.org/10.1007/s00373-025-02991-w","title":"Hamiltonian Cycles Avoiding a Spanning Forest or a Spanning Cycle Subgraph in Tournaments","display_name":"Hamiltonian Cycles Avoiding a Spanning Forest or a Spanning Cycle Subgraph in Tournaments","publication_year":2025,"publication_date":"2025-11-17","ids":{"openalex":"https://openalex.org/W4416273832","doi":"https://doi.org/10.1007/s00373-025-02991-w"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-025-02991-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-025-02991-w","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","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/A5098060069","display_name":"Yaoxiang Di","orcid":null},"institutions":[{"id":"https://openalex.org/I181877577","display_name":"Shanxi University","ror":"https://ror.org/03y3e3s17","country_code":"CN","type":"education","lineage":["https://openalex.org/I181877577"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yaoxiang Di","raw_affiliation_strings":["Key Laboratory of Complex Systems and Data Science of Ministry of Education, Shanxi University, Taiyuan, Shanxi, 030006, PR China","School of Mathematics and Statistics, Shanxi University, Taiyuan, Shanxi, 030006, PR China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory of Complex Systems and Data Science of Ministry of Education, Shanxi University, Taiyuan, Shanxi, 030006, PR China","institution_ids":["https://openalex.org/I181877577"]},{"raw_affiliation_string":"School of Mathematics and Statistics, Shanxi University, Taiyuan, Shanxi, 030006, PR China","institution_ids":["https://openalex.org/I181877577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108578275","display_name":"Ruijuan Li","orcid":"https://orcid.org/0000-0001-8062-3459"},"institutions":[{"id":"https://openalex.org/I181877577","display_name":"Shanxi University","ror":"https://ror.org/03y3e3s17","country_code":"CN","type":"education","lineage":["https://openalex.org/I181877577"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ruijuan Li","raw_affiliation_strings":["Key Laboratory of Complex Systems and Data Science of Ministry of Education, Shanxi University, Taiyuan, Shanxi, 030006, PR China","School of Mathematics and Statistics, Shanxi University, Taiyuan, Shanxi, 030006, PR China"],"raw_orcid":"https://orcid.org/0000-0001-8062-3459","affiliations":[{"raw_affiliation_string":"Key Laboratory of Complex Systems and Data Science of Ministry of Education, Shanxi University, Taiyuan, Shanxi, 030006, PR China","institution_ids":["https://openalex.org/I181877577"]},{"raw_affiliation_string":"School of Mathematics and Statistics, Shanxi University, Taiyuan, Shanxi, 030006, PR China","institution_ids":["https://openalex.org/I181877577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048171321","display_name":"Xinhong Zhang","orcid":"https://orcid.org/0000-0003-2403-4777"},"institutions":[{"id":"https://openalex.org/I46305995","display_name":"Taiyuan University of Science and Technology","ror":"https://ror.org/01wcbdc92","country_code":"CN","type":"education","lineage":["https://openalex.org/I46305995"]},{"id":"https://openalex.org/I9086337","display_name":"Taiyuan University of Technology","ror":"https://ror.org/03kv08d37","country_code":"CN","type":"education","lineage":["https://openalex.org/I9086337"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinhong Zhang","raw_affiliation_strings":["Department of Applied Mathematics, Taiyuan University of Science and Technology, Taiyuan, 030024, Shanxi, PR China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Taiyuan University of Science and Technology, Taiyuan, 030024, Shanxi, PR China","institution_ids":["https://openalex.org/I46305995","https://openalex.org/I9086337"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5098060069"],"corresponding_institution_ids":["https://openalex.org/I181877577"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34126195,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"41","issue":"6","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7717000246047974,"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.7717000246047974,"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.09989999979734421,"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.04800000041723251,"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/spanning-tree","display_name":"Spanning tree","score":0.7513999938964844},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.7422999739646912},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5846999883651733},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5717999935150146},{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.5705999732017517},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5478000044822693},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5091000199317932},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4205000102519989}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8787999749183655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.823199987411499},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7513999938964844},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7422999739646912},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5846999883651733},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5717999935150146},{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.5705999732017517},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5478000044822693},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5091000199317932},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.461899995803833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4205000102519989},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.41350001096725464},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.32989999651908875},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.3294999897480011},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.3156999945640564},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.2761000096797943},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.2750000059604645},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2680000066757202},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.266400009393692},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2653000056743622},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2632000148296356}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00373-025-02991-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-025-02991-w","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1991927950","https://openalex.org/W1996277976","https://openalex.org/W2048972313","https://openalex.org/W2083532740","https://openalex.org/W2109790328","https://openalex.org/W4240899876","https://openalex.org/W4288347397","https://openalex.org/W4403557821","https://openalex.org/W4410240874"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-28T09:55:06.730142","created_date":"2025-11-17T00:00:00"}