{"id":"https://openalex.org/W1967318939","doi":"https://doi.org/10.1016/0095-8956(85)90072-3","title":"Hamiltonian cycles in cubic 3-connected bipartite planar graphs","display_name":"Hamiltonian cycles in cubic 3-connected bipartite planar graphs","publication_year":1985,"publication_date":"1985-06-01","ids":{"openalex":"https://openalex.org/W1967318939","doi":"https://doi.org/10.1016/0095-8956(85)90072-3","mag":"1967318939"},"language":"en","primary_location":{"id":"doi:10.1016/0095-8956(85)90072-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0095-8956(85)90072-3","pdf_url":null,"source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Theory, Series B","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/A5041002497","display_name":"Derek Holton","orcid":"https://orcid.org/0000-0003-2113-3980"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"D.A Holton","raw_affiliation_strings":["University of Melbourne, Parkville, Victoria, Australia","University of Melbourne, Parkville, Victoria, Australia#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Melbourne, Parkville, Victoria, Australia","institution_ids":["https://openalex.org/I165779595"]},{"raw_affiliation_string":"University of Melbourne, Parkville, Victoria, Australia#TAB#","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071645671","display_name":"Bennet Manvel","orcid":null},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"B Manvel","raw_affiliation_strings":["Colorado State University, Fort Collins, Colorado 80523 USA"],"affiliations":[{"raw_affiliation_string":"Colorado State University, Fort Collins, Colorado 80523 USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014961672","display_name":"Brendan D. McKay","orcid":"https://orcid.org/0000-0002-3553-0496"},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"B.D McKay","raw_affiliation_strings":["Australian National University, Canberra, A.C.T., Australia","Australian National Univ., Canberra, A.C.T., Australia"],"affiliations":[{"raw_affiliation_string":"Australian National University, Canberra, A.C.T., Australia","institution_ids":["https://openalex.org/I118347636"]},{"raw_affiliation_string":"Australian National Univ., Canberra, A.C.T., Australia","institution_ids":["https://openalex.org/I118347636"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5041002497"],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":{"value":3420,"currency":"USD","value_usd":3420},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":81,"citation_normalized_percentile":{"value":0.09087578,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"38","issue":"3","first_page":"279","last_page":"297"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9965000152587891,"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.9965000152587891,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9800000190734863,"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.9459999799728394,"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/bipartite-graph","display_name":"Bipartite graph","score":0.8991214036941528},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.7156037092208862},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6867843866348267},{"id":"https://openalex.org/keywords/pancyclic-graph","display_name":"Pancyclic graph","score":0.6766142845153809},{"id":"https://openalex.org/keywords/foster-graph","display_name":"Foster graph","score":0.650518000125885},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6413273811340332},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.6186778545379639},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.590782880783081},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.5734243988990784},{"id":"https://openalex.org/keywords/polyhedral-graph","display_name":"Polyhedral graph","score":0.5326746702194214},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.4918551445007324},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3694763779640198},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3378966152667999},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.289694219827652},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2551020383834839},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.14716023206710815},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13547897338867188},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1296422779560089},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.04111257195472717}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8991214036941528},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.7156037092208862},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6867843866348267},{"id":"https://openalex.org/C166911692","wikidata":"https://www.wikidata.org/wiki/Q7130424","display_name":"Pancyclic graph","level":5,"score":0.6766142845153809},{"id":"https://openalex.org/C68996132","wikidata":"https://www.wikidata.org/wiki/Q3115485","display_name":"Foster graph","level":5,"score":0.650518000125885},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6413273811340332},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.6186778545379639},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.590782880783081},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.5734243988990784},{"id":"https://openalex.org/C91233654","wikidata":"https://www.wikidata.org/wiki/Q4555371","display_name":"Polyhedral graph","level":5,"score":0.5326746702194214},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.4918551445007324},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3694763779640198},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3378966152667999},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.289694219827652},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2551020383834839},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.14716023206710815},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13547897338867188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1296422779560089},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.04111257195472717},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0095-8956(85)90072-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0095-8956(85)90072-3","pdf_url":null,"source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Theory, Series B","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":12,"referenced_works":["https://openalex.org/W1995621089","https://openalex.org/W2010273295","https://openalex.org/W2015468112","https://openalex.org/W2016431111","https://openalex.org/W2021355739","https://openalex.org/W2027286987","https://openalex.org/W2050065904","https://openalex.org/W2050906361","https://openalex.org/W2065463969","https://openalex.org/W2073389852","https://openalex.org/W2078415120","https://openalex.org/W2078677804"],"related_works":["https://openalex.org/W2952856011","https://openalex.org/W1618127724","https://openalex.org/W3010627705","https://openalex.org/W2046852387","https://openalex.org/W4366823933","https://openalex.org/W2969955840","https://openalex.org/W2928534012","https://openalex.org/W2377278407","https://openalex.org/W2138867415","https://openalex.org/W203133463"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":24},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}