{"id":"https://openalex.org/W2076040416","doi":"https://doi.org/10.1090/s0025-5718-2013-02741-x","title":"Counting Hamiltonian cycles in bipartite graphs","display_name":"Counting Hamiltonian cycles in bipartite graphs","publication_year":2013,"publication_date":"2013-07-15","ids":{"openalex":"https://openalex.org/W2076040416","doi":"https://doi.org/10.1090/s0025-5718-2013-02741-x","mag":"2076040416"},"language":"en","primary_location":{"id":"doi:10.1090/s0025-5718-2013-02741-x","is_oa":false,"landing_page_url":"https://doi.org/10.1090/s0025-5718-2013-02741-x","pdf_url":null,"source":{"id":"https://openalex.org/S102439543","display_name":"Mathematics of Computation","issn_l":"0025-5718","issn":["0025-5718","1088-6842"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315719","host_organization_name":"American Mathematical Society","host_organization_lineage":["https://openalex.org/P4310315719"],"host_organization_lineage_names":["American Mathematical Society"],"type":"journal"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics of Computation","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/A5007724460","display_name":"Harri Haanp\u00e4\u00e4","orcid":null},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Harri Haanp\u00e4\u00e4","raw_affiliation_strings":["Department of Communications and Networking, Aalto University School of Electrical Engineering, P.O. Box 13000, 00076 Aalto, Finland","DEPARTMENT OF COMMUNICATIONS AND NETWORKING AALTO UNIVERSITY SCHOOL OF ELECTRICAL ENGINEERING P.O. BOX 13000, 00076 AALTO FINLAND"],"affiliations":[{"raw_affiliation_string":"Department of Communications and Networking, Aalto University School of Electrical Engineering, P.O. Box 13000, 00076 Aalto, Finland","institution_ids":["https://openalex.org/I9927081"]},{"raw_affiliation_string":"DEPARTMENT OF COMMUNICATIONS AND NETWORKING AALTO UNIVERSITY SCHOOL OF ELECTRICAL ENGINEERING P.O. BOX 13000, 00076 AALTO FINLAND","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009643905","display_name":"Patric R. J. \u00d6sterg\u00e5rd","orcid":"https://orcid.org/0000-0003-0426-9771"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Patric R. J. \u00d6sterg\u00e5rd","raw_affiliation_strings":["DEPARTMENT OF COMMUNICATIONS AND NETWORKING AALTO UNIVERSITY SCHOOL OF ELECTRICAL ENGINEERING P.O. BOX 13000, 00076 AALTO FINLAND"],"affiliations":[{"raw_affiliation_string":"DEPARTMENT OF COMMUNICATIONS AND NETWORKING AALTO UNIVERSITY SCHOOL OF ELECTRICAL ENGINEERING P.O. BOX 13000, 00076 AALTO FINLAND","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007724460"],"corresponding_institution_ids":["https://openalex.org/I9927081"],"apc_list":null,"apc_paid":null,"fwci":0.4729,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.70065141,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"83","issue":"286","first_page":"979","last_page":"995"},"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.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.9098129272460938},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8177082538604736},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.573735773563385},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5657491087913513},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.47458600997924805},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46111536026000977},{"id":"https://openalex.org/keywords/pancyclic-graph","display_name":"Pancyclic graph","score":0.4110739231109619},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3626973628997803},{"id":"https://openalex.org/keywords/mathematical-physics","display_name":"Mathematical physics","score":0.3476521968841553},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2764611840248108},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24298664927482605},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1913379728794098},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09431639313697815}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.9098129272460938},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8177082538604736},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.573735773563385},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5657491087913513},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.47458600997924805},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46111536026000977},{"id":"https://openalex.org/C166911692","wikidata":"https://www.wikidata.org/wiki/Q7130424","display_name":"Pancyclic graph","level":5,"score":0.4110739231109619},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3626973628997803},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.3476521968841553},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2764611840248108},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24298664927482605},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1913379728794098},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09431639313697815}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/s0025-5718-2013-02741-x","is_oa":false,"landing_page_url":"https://doi.org/10.1090/s0025-5718-2013-02741-x","pdf_url":null,"source":{"id":"https://openalex.org/S102439543","display_name":"Mathematics of Computation","issn_l":"0025-5718","issn":["0025-5718","1088-6842"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315719","host_organization_name":"American Mathematical Society","host_organization_lineage":["https://openalex.org/P4310315719"],"host_organization_lineage_names":["American Mathematical Society"],"type":"journal"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics of Computation","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":27,"referenced_works":["https://openalex.org/W180452353","https://openalex.org/W624804159","https://openalex.org/W1479863711","https://openalex.org/W1487753427","https://openalex.org/W1488721024","https://openalex.org/W1519124758","https://openalex.org/W1602929565","https://openalex.org/W1943280371","https://openalex.org/W1987279942","https://openalex.org/W1999227640","https://openalex.org/W2011039300","https://openalex.org/W2015751597","https://openalex.org/W2053191344","https://openalex.org/W2054204410","https://openalex.org/W2059207171","https://openalex.org/W2088131503","https://openalex.org/W2115826669","https://openalex.org/W2130586999","https://openalex.org/W2139428672","https://openalex.org/W2163445026","https://openalex.org/W2335389215","https://openalex.org/W2724785933","https://openalex.org/W2741626527","https://openalex.org/W2752853835","https://openalex.org/W2752885492","https://openalex.org/W2799004609","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W2242881416","https://openalex.org/W2962687631","https://openalex.org/W2057580655","https://openalex.org/W2952856011","https://openalex.org/W2354668236","https://openalex.org/W2026708846","https://openalex.org/W116806750","https://openalex.org/W203133463","https://openalex.org/W2019627940","https://openalex.org/W2082273344"],"abstract_inverted_index":{"A":[0],"method":[1],"for":[2],"counting":[3],"Hamiltonian":[4,53,62,82,94],"cycles":[5,54,63,83],"in":[6],"bipartite":[7],"graphs":[8],"is":[9,43,110],"developed":[10],"with":[11,64],"the":[12,16,21,30,34,40,47,71,100],"main":[13],"focus":[14],"on":[15,99,105],"long-standing":[17],"open":[18],"case":[19],"of":[20,29,33,39,49,52,61,93,102],"6-cube.":[22],"Dynamic":[23],"programming":[24],"as":[25,27],"well":[26],"utilization":[28],"automorphism":[31],"group":[32],"graph":[35],"are":[36],"central":[37],"ingredients":[38],"method.":[41],"It":[42,67],"further":[44],"shown":[45],"how":[46],"number":[48,101],"equivalence":[50,91],"classes":[51,92],"can":[55],"be":[56],"obtained":[57],"via":[58],"a":[59,106],"classification":[60],"nontrivial":[65],"automorphisms.":[66],"turns":[68],"out":[69],"that":[70],"6-cube":[72],"has":[73],"35":[74],"838":[75],"213":[76],"722":[77],"570":[78],"883":[79],"870":[80],"720":[81],"and":[84],"777":[85],"739":[86],"016":[87],"577":[88],"752":[89],"714":[90],"cycles.":[95],"The":[96],"old":[97],"result":[98],"knight\u00e2\u0080\u0099s":[103],"tours":[104],"$8\\times":[107],"8$":[108],"chessboard":[109],"confirmed.":[111]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}