{"id":"https://openalex.org/W2048025954","doi":"https://doi.org/10.1002/net.3230260304","title":"Hamilton cycles and paths in butterfly graphs","display_name":"Hamilton cycles and paths in butterfly graphs","publication_year":1995,"publication_date":"1995-10-01","ids":{"openalex":"https://openalex.org/W2048025954","doi":"https://doi.org/10.1002/net.3230260304","mag":"2048025954"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230260304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230260304","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"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":"Networks","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/A5037593295","display_name":"Stephen A. Wong","orcid":null},"institutions":[{"id":"https://openalex.org/I122879082","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29","country_code":"CA","type":"government","lineage":["https://openalex.org/I122879082"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Stephen A. Wong","raw_affiliation_strings":["1702 Layton Drive, North Vancouver, BC, V7H 1 \u00d7 8, Canada","This work was done while the author was the holder of a Natural Sciences and Engineering Research Council of Canada Summer Undergraduate Scholarship under the supervision of Professor Brian Alspach"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"1702 Layton Drive, North Vancouver, BC, V7H 1 \u00d7 8, Canada","institution_ids":[]},{"raw_affiliation_string":"This work was done while the author was the holder of a Natural Sciences and Engineering Research Council of Canada Summer Undergraduate Scholarship under the supervision of Professor Brian Alspach","institution_ids":["https://openalex.org/I122879082"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037593295"],"corresponding_institution_ids":["https://openalex.org/I122879082"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.5689,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.81851989,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"26","issue":"3","first_page":"145","last_page":"150"},"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.9972000122070312,"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.9972000122070312,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9864000082015991,"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.9846000075340271,"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.8597445487976074},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.8372374773025513},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7057597041130066},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6811717748641968},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5735191106796265},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47007113695144653},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4665246903896332},{"id":"https://openalex.org/keywords/complete-graph","display_name":"Complete graph","score":0.41384562849998474},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35867810249328613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10492470860481262}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8597445487976074},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8372374773025513},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7057597041130066},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6811717748641968},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5735191106796265},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47007113695144653},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4665246903896332},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.41384562849998474},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35867810249328613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10492470860481262},{"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/net.3230260304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230260304","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"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":"Networks","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":5,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1566364654","https://openalex.org/W1966151552","https://openalex.org/W2064865431","https://openalex.org/W2146796596"],"related_works":["https://openalex.org/W2962785705","https://openalex.org/W1979242696","https://openalex.org/W1503612811","https://openalex.org/W4382930395","https://openalex.org/W2413429894","https://openalex.org/W2951120675","https://openalex.org/W4389471461","https://openalex.org/W2159382836","https://openalex.org/W2886112286","https://openalex.org/W2949236759"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"cycle":[2,11],"C":[3,13],"in":[4,24,89,96,136],"a":[5,9,21,27,60,71,83,112,128],"graph":[6,73],"G":[7,18,25,36,41,56,69,101],"is":[8,26,42,70,82,102,146,150],"Hamilton":[10,28,43,61,84,106,129],"if":[12,30,46],"contains":[14,32,127],"every":[15,33],"vertex":[16,34,88,95],"of":[17,35,50,55,77,157],".":[19,37,67,109,159],"Similarly,":[20],"path":[22,29,62,85],"P":[23,31],"We":[38,110],"say":[39],"that":[40,115,141],"\u2010":[44,107],"connected":[45],"for":[47,154],"any":[48,87,94],"pair":[49],"vertices,":[51],"u":[52,64],"and":[53,80,152],"v":[54,66],",":[57],"There":[58],"exists":[59],"from":[63,86],"to":[65,93,104],"If":[68],"bipartite":[72],"with":[74],"bipartition":[75,91],"sets":[76],"equal":[78],"size,":[79],"there":[81],"one":[90],"set":[92],"the":[97,116,138],"other,":[98],"The":[99],"n":[100,117,125,144,149,158],"said":[103],"be":[105],"laceable":[108],"present":[111],"proof":[113],"showing":[114],"\u2010dimensional":[118],"k":[119],"\u2010ary":[120],"butterfly":[121],"graph,":[122],"denoted":[123],"BF(k,":[124],"),":[126],"cycle.":[130],"Then,":[131],"we":[132],"use":[133],"this":[134],"result":[135,140],"proving":[137],"stronger":[139],"BF":[142],"(k,":[143],")":[145],"Hamilton\u2010laceable":[147],"when":[148],"even":[151],"Hamilton\u2010connected":[153],"odd":[155],"values":[156]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}