{"id":"https://openalex.org/W1481308841","doi":"https://doi.org/10.37236/690","title":"Hamiltonian Cycles in the Square of a Graph","display_name":"Hamiltonian Cycles in the Square of a Graph","publication_year":2011,"publication_date":"2011-10-17","ids":{"openalex":"https://openalex.org/W1481308841","doi":"https://doi.org/10.37236/690","mag":"1481308841"},"language":"en","primary_location":{"id":"doi:10.37236/690","is_oa":true,"landing_page_url":"https://doi.org/10.37236/690","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p203/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/v18i1p203/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027940381","display_name":"Jan Ekstein","orcid":"https://orcid.org/0000-0003-0047-7549"},"institutions":[{"id":"https://openalex.org/I92715842","display_name":"University of West Bohemia in Pilsen","ror":"https://ror.org/040t43x18","country_code":"CZ","type":"education","lineage":["https://openalex.org/I92715842"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Ekstein","raw_affiliation_strings":["Department of Mathematics University of West Bohemia Pilsen, Czech Republic","#N#University of West Bohemia#N#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics University of West Bohemia Pilsen, Czech Republic","institution_ids":["https://openalex.org/I92715842"]},{"raw_affiliation_string":"#N#University of West Bohemia#N#","institution_ids":["https://openalex.org/I92715842"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5027940381"],"corresponding_institution_ids":["https://openalex.org/I92715842"],"apc_list":null,"apc_paid":null,"fwci":2.2568,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.86609641,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"18","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9979000091552734,"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.9977999925613403,"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/mathematics","display_name":"Mathematics","score":0.8028713464736938},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7735854387283325},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5673032402992249},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5264533162117004},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48381751775741577},{"id":"https://openalex.org/keywords/quartic-graph","display_name":"Quartic graph","score":0.4837046265602112},{"id":"https://openalex.org/keywords/regular-graph","display_name":"Regular graph","score":0.4591062068939209},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44537287950515747},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.4271255433559418},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.3831466734409332},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2659275531768799}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8028713464736938},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7735854387283325},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5673032402992249},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5264533162117004},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48381751775741577},{"id":"https://openalex.org/C199692417","wikidata":"https://www.wikidata.org/wiki/Q7269362","display_name":"Quartic graph","level":5,"score":0.4837046265602112},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.4591062068939209},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44537287950515747},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.4271255433559418},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.3831466734409332},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2659275531768799}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/690","is_oa":true,"landing_page_url":"https://doi.org/10.37236/690","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p203/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"}],"best_oa_location":{"id":"doi:10.37236/690","is_oa":true,"landing_page_url":"https://doi.org/10.37236/690","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p203/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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1481308841.pdf","grobid_xml":"https://content.openalex.org/works/W1481308841.grobid-xml"},"referenced_works_count":3,"referenced_works":["https://openalex.org/W1985249877","https://openalex.org/W1989780696","https://openalex.org/W2047364737"],"related_works":["https://openalex.org/W2377278407","https://openalex.org/W2138867415","https://openalex.org/W347024151","https://openalex.org/W2011032737","https://openalex.org/W1957980392","https://openalex.org/W1977187614","https://openalex.org/W4293154719","https://openalex.org/W1534832295","https://openalex.org/W2605498182","https://openalex.org/W1022886965"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,44],"under":[3],"certain":[4],"conditions":[5,33],"the":[6,9,37],"square":[7,21,38],"of":[8,36,39,47],"graph":[10,42,55],"obtained":[11],"by":[12],"identifying":[13],"a":[14,40,53,58],"vertex":[15,46,60],"in":[16,52],"two":[17,63],"graphs":[18],"with":[19],"hamiltonian":[20],"is":[22],"also":[23],"hamiltonian.":[24],"Using":[25],"this":[26],"result,":[27],"we":[28],"prove":[29],"necessary":[30],"and":[31,61],"sufficient":[32],"for":[34],"hamiltonicity":[35],"connected":[41],"such":[43],"every":[45],"degree":[48],"at":[49,67,69],"least":[50,70],"three":[51],"block":[54],"corresponds":[56],"to":[57],"cut":[59],"any":[62],"these":[64],"vertices":[65],"are":[66],"distance":[68],"four.":[71]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}