{"id":"https://openalex.org/W3146499792","doi":"https://doi.org/10.51408/1963-0055","title":"A Note on Hamiltonian Bypasses in Digraphs with Large Degrees","display_name":"A Note on Hamiltonian Bypasses in Digraphs with Large Degrees","publication_year":2020,"publication_date":"2020-12-25","ids":{"openalex":"https://openalex.org/W3146499792","doi":"https://doi.org/10.51408/1963-0055","mag":"3146499792"},"language":"en","primary_location":{"id":"doi:10.51408/1963-0055","doi":"https://doi.org/10.51408/1963-0055","is_oa":true,"landing_page_url":"https://doi.org/10.51408/1963-0055","pdf_url":"http://mpcs.sci.am/index.php/mpcs/article/download/457/388/799","source":{"id":"https://openalex.org/S4210232194","display_name":"Mathematical Problems of Computer Science","issn_l":"2579-2784","issn":["2579-2784","2738-2788"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Problems of Computer Science","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://mpcs.sci.am/index.php/mpcs/article/download/457/388/799","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034851775","display_name":"Samvel Kh. Darbinyan","orcid":"https://orcid.org/0009-0000-1823-0806","observed_orcids":["https://orcid.org/0009-0000-1823-0806"]},"institutions":[{"id":"https://openalex.org/I4210133484","display_name":"Institute for Informatics and Automation Problems","ror":"https://ror.org/04a8k4p47","country_code":"AM","type":"facility","lineage":["https://openalex.org/I4210133484","https://openalex.org/I99064381"]}],"countries":["AM"],"is_corresponding":true,"raw_author_name":"Samvel Darbinyan","raw_affiliation_strings":["Institute for Informatics and Automation Problems of NAS RA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Informatics and Automation Problems of NAS RA","institution_ids":["https://openalex.org/I4210133484"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034851775"],"corresponding_institution_ids":["https://openalex.org/I4210133484"],"apc_list":null,"apc_paid":null,"fwci":0.1988,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.38506598,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"7","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9696999788284302,"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.9696999788284302,"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.01510000042617321,"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.004800000227987766,"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/hamiltonian-paths","display_name":"Hamiltonian paths","score":0.8199999928474426},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.6990000009536743},{"id":"https://openalex.org/keywords/hamiltonian-graphs","display_name":"Hamiltonian graphs","score":0.6010000109672546},{"id":"https://openalex.org/keywords/degree-conditions","display_name":"degree conditions","score":0.35499998927116394}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7179604768753052},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6929184198379517},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.6474558711051941},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6443760991096497},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5727006196975708},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.47933730483055115},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4529021680355072},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.3910929560661316},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38076120615005493},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.36283451318740845},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.51408/1963-0055","doi":"https://doi.org/10.51408/1963-0055","is_oa":true,"landing_page_url":"https://doi.org/10.51408/1963-0055","pdf_url":"http://mpcs.sci.am/index.php/mpcs/article/download/457/388/799","source":{"id":"https://openalex.org/S4210232194","display_name":"Mathematical Problems of Computer Science","issn_l":"2579-2784","issn":["2579-2784","2738-2788"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Problems of Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.51408/1963-0055","doi":"https://doi.org/10.51408/1963-0055","is_oa":true,"landing_page_url":"https://doi.org/10.51408/1963-0055","pdf_url":"http://mpcs.sci.am/index.php/mpcs/article/download/457/388/799","source":{"id":"https://openalex.org/S4210232194","display_name":"Mathematical Problems of Computer Science","issn_l":"2579-2784","issn":["2579-2784","2738-2788"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Problems of Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3146499792.pdf","grobid_xml":"https://content.openalex.org/works/W3146499792.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1427832263","https://openalex.org/W1984327852","https://openalex.org/W2036286064","https://openalex.org/W2064087232","https://openalex.org/W2076404940","https://openalex.org/W2078698054","https://openalex.org/W2087159183","https://openalex.org/W2157737769","https://openalex.org/W2213576581","https://openalex.org/W2355209521","https://openalex.org/W2782713807","https://openalex.org/W2963775107","https://openalex.org/W4254686712"],"related_works":["https://openalex.org/W4414454296","https://openalex.org/W4317440123","https://openalex.org/W4417491556","https://openalex.org/W4381247972","https://openalex.org/W4394696501","https://openalex.org/W4386742861","https://openalex.org/W1427832263","https://openalex.org/W2952230211","https://openalex.org/W4313346206","https://openalex.org/W2386162590"],"abstract_inverted_index":{"Let":[0],"D":[1,41,51],"be":[2],"a":[3,30,53],"2-strongly":[4],"connected":[5],"directed":[6],"graph":[7],"of":[8,32],"order":[9],"p":[10,17],"\u2265":[11,16],"3.":[12],"Suppose":[13],"that":[14,39],"d(x)":[15],"for":[18],"every":[19],"vertex":[20,31,60],"x":[21],"\u2208":[22],"V":[23],"(D)":[24],"\\":[25],"{x0},":[26],"where":[27],"x0":[28],"is":[29,42],"D.":[33],"In":[34],"this":[35],"paper,":[36],"we":[37],"show":[38],"if":[40],"Hamiltonian":[43,54],"or":[44],"d(x0)":[45],">":[46],"2(p":[47],"\u2212":[48],"1)/5,":[49],"then":[50],"contains":[52],"path,":[55],"in":[56],"which":[57],"the":[58,62],"initial":[59],"dominates":[61],"terminal":[63],"vertex.":[64]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":1}],"updated_date":"2026-11-13T13:42:25.865203","created_date":"2021-04-13T00:00:00"}