{"id":"https://openalex.org/W1984327852","doi":"https://doi.org/10.1002/jgt.3190080111","title":"On the existence of a specified cycle in digraphs with constraints on degrees","display_name":"On the existence of a specified cycle in digraphs with constraints on degrees","publication_year":1984,"publication_date":"1984-03-01","ids":{"openalex":"https://openalex.org/W1984327852","doi":"https://doi.org/10.1002/jgt.3190080111","mag":"1984327852"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190080111","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190080111","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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/A5023730720","display_name":"Abdelhamid Benhocine","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Abdelhamid Benhocine","raw_affiliation_strings":["BATIMENTC.2N\u00b0211 SETIF, ALGERIA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BATIMENTC.2N\u00b0211 SETIF, ALGERIA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023730720"],"corresponding_institution_ids":[],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.10376457,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"1","first_page":"101","last_page":"107"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9990000128746033,"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/T11476","display_name":"Graph theory and applications","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/digraph","display_name":"Digraph","score":0.9293457269668579},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.8941457271575928},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.822075605392456},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7308726906776428},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.6951808333396912},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5479946732521057},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.47979313135147095},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4763472378253937},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4652807116508484},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42381781339645386},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.412668377161026},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09455996751785278},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.043104082345962524}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.9293457269668579},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8941457271575928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.822075605392456},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7308726906776428},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.6951808333396912},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5479946732521057},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.47979313135147095},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4763472378253937},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4652807116508484},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42381781339645386},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.412668377161026},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09455996751785278},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.043104082345962524},{"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":[{"id":"doi:10.1002/jgt.3190080111","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190080111","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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":9,"referenced_works":["https://openalex.org/W145545524","https://openalex.org/W592112248","https://openalex.org/W1976519893","https://openalex.org/W2028539479","https://openalex.org/W2039505757","https://openalex.org/W2082270016","https://openalex.org/W2121867501","https://openalex.org/W2157737769","https://openalex.org/W6644235852"],"related_works":["https://openalex.org/W1643271191","https://openalex.org/W3088611359","https://openalex.org/W3196251681","https://openalex.org/W4255598955","https://openalex.org/W2962785705","https://openalex.org/W2350235717","https://openalex.org/W2386162590","https://openalex.org/W2949833368","https://openalex.org/W4300545322","https://openalex.org/W1428816444"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"prove":[2],"that":[3,12,19,37,43],"Woodall's":[4],"and":[5,54],"Ghouila\u2010Houri's":[6],"conditions":[7],"on":[8],"degrees":[9],"which":[10],"ensure":[11,18],"a":[13,25,55],"digraph":[14],"is":[15],"Hamiltonian,":[16],"also":[17],"it":[20,39],"contains":[21,40],"the":[22,34,47],"analog":[23],"of":[24],"directed":[26],"Hamiltonian":[27,56],"cycle":[28],"but":[29],"with":[30],"one":[31],"edge":[32,53],"pointing":[33],"wrong":[35],"way;":[36],"is,":[38],"two":[41],"vertices":[42],"are":[44],"connected":[45],"in":[46],"same":[48],"direction":[49],"by":[50],"both":[51],"an":[52],"path.":[57]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}