{"id":"https://openalex.org/W2101463671","doi":"https://doi.org/10.37236/204","title":"Vertex-Oriented Hamilton Cycles in Directed Graphs","display_name":"Vertex-Oriented Hamilton Cycles in Directed Graphs","publication_year":2009,"publication_date":"2009-09-18","ids":{"openalex":"https://openalex.org/W2101463671","doi":"https://doi.org/10.37236/204","mag":"2101463671"},"language":"en","primary_location":{"id":"doi:10.37236/204","is_oa":true,"landing_page_url":"https://doi.org/10.37236/204","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r115/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r115/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051665245","display_name":"Michael J. Plantholt","orcid":"https://orcid.org/0000-0001-8956-0626"},"institutions":[{"id":"https://openalex.org/I47301684","display_name":"Illinois State University","ror":"https://ror.org/050kcr883","country_code":"US","type":"education","lineage":["https://openalex.org/I47301684"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael J. Plantholt","raw_affiliation_strings":["Department of Mathematics Illinois State University Normal, IL 61790-4520, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics Illinois State University Normal, IL 61790-4520, USA","institution_ids":["https://openalex.org/I47301684"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054487178","display_name":"Shailesh K. Tipnis","orcid":null},"institutions":[{"id":"https://openalex.org/I47301684","display_name":"Illinois State University","ror":"https://ror.org/050kcr883","country_code":"US","type":"education","lineage":["https://openalex.org/I47301684"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shailesh K. Tipnis","raw_affiliation_strings":["Department of Mathematics Illinois State University Normal, IL 61790-4520"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics Illinois State University Normal, IL 61790-4520","institution_ids":["https://openalex.org/I47301684"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054487178"],"corresponding_institution_ids":["https://openalex.org/I47301684"],"apc_list":null,"apc_paid":null,"fwci":0.3048,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.63918959,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"16","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9995999932289124,"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.9983000159263611,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.993399977684021,"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/combinatorics","display_name":"Combinatorics","score":0.8965731263160706},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.8129706382751465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7967911958694458},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.6209592819213867},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6151788234710693},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5278836488723755},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47531658411026},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4683460593223572},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4510301351547241},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38376152515411377},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.049200236797332764},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.04787394404411316}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8965731263160706},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8129706382751465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7967911958694458},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6209592819213867},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6151788234710693},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5278836488723755},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47531658411026},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4683460593223572},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4510301351547241},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38376152515411377},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.049200236797332764},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.04787394404411316},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/204","is_oa":true,"landing_page_url":"https://doi.org/10.37236/204","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r115/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.214.4126","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.4126","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_16/PDF/v16i1r115.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/204","is_oa":true,"landing_page_url":"https://doi.org/10.37236/204","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r115/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2101463671.pdf","grobid_xml":"https://content.openalex.org/works/W2101463671.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1971367602","https://openalex.org/W1985542405","https://openalex.org/W2018991768","https://openalex.org/W2028539479","https://openalex.org/W2397981965","https://openalex.org/W2477763613","https://openalex.org/W2611093227","https://openalex.org/W2799004609"],"related_works":["https://openalex.org/W2949833368","https://openalex.org/W4300545322","https://openalex.org/W2071319668","https://openalex.org/W1643271191","https://openalex.org/W3190612612","https://openalex.org/W2014769093","https://openalex.org/W306769933","https://openalex.org/W2963132554","https://openalex.org/W2101463671","https://openalex.org/W4287549860"],"abstract_inverted_index":{"Let":[0,83],"$D$":[1,15,24,44,64,71,100,110,166],"be":[2,89],"a":[3,17,35,46,79,90,102,128,147,160,186],"directed":[4,36,47,129,148],"graph":[5,22,48,108],"of":[6,29,60,63,81,92,120,141,159],"order":[7,51],"$n$.":[8],"An":[9],"anti-directed":[10,74],"Hamilton":[11,18,75,97,103,163],"cycle":[12,19,98,104,164],"$H$":[13,33,105,121,142],"in":[14,20,32,38,99,106,131,150,165],"is":[16,45,65,101],"the":[21,55,58,107,157,168],"underlying":[23,109],"such":[25,111],"that":[26,42,112],"no":[27],"pair":[28],"consecutive":[30,118,139],"arcs":[31,119,140],"form":[34,127,146],"path":[37,130,149],"$D$.":[39,151],"We":[40,152],"prove":[41],"if":[43,54],"with":[49],"even":[50],"$n$":[52],"and":[53,57,175],"indegree":[56],"outdegree":[59],"each":[61,114,135],"vertex":[62],"at":[66],"least":[67],"${2\\over":[68],"3}n$":[69,174],"then":[70],"contains":[72],"an":[73],"cycle.":[76],"This":[77,184],"improves":[78],"bound":[80,187],"Grant.":[82],"$V(D)":[84],"=":[85],"P":[86],"\\cup":[87],"Q$":[88],"partition":[91],"$V(D)$.":[93],"A":[94],"$(P,Q)$":[95,161],"vertex-oriented":[96,162],"for":[113,134,156,167],"$v":[115,136],"\\in":[116,137],"P$,":[117],"incident":[122,143],"on":[123,144],"$v$":[124,145],"do":[125],"not":[126],"$D$,":[132],"and,":[133],"Q$,":[138],"give":[153],"sufficient":[154],"conditions":[155],"existence":[158],"cases":[169],"when":[170,176],"$|P|":[171],"\\geq":[172],"{2\\over":[173,182],"${1\\over":[177],"3}n":[178],"\\leq":[179,181],"|P|":[180],"3}n$.":[183],"sharpens":[185],"given":[188],"by":[189],"Badheka":[190],"et":[191],"al.":[192]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}