{"id":"https://openalex.org/W7117965338","doi":"https://doi.org/10.1007/978-3-032-11835-6_19","title":"Matchings with\u00a0Five Directions in\u00a0Hypercubes Extend to\u00a0Hamilton Cycles and\u00a0Paths with\u00a0Prescribed Ends","display_name":"Matchings with\u00a0Five Directions in\u00a0Hypercubes Extend to\u00a0Hamilton Cycles and\u00a0Paths with\u00a0Prescribed Ends","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7117965338","doi":"https://doi.org/10.1007/978-3-032-11835-6_19"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-11835-6_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-11835-6_19","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5071107269","display_name":"Ji\u0159\u00ed Fink","orcid":"https://orcid.org/0000-0001-5065-1213"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ji\u0159\u00ed Fink","raw_affiliation_strings":["Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Prague, Czechia"],"raw_orcid":"https://orcid.org/0000-0001-5065-1213","affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5116129001","display_name":"Vojt\u011bch Hotmar","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Vojt\u011bch Hotmar","raw_affiliation_strings":["Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Prague, Czechia"],"raw_orcid":"https://orcid.org/0009-0003-6167-6733","affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5116129001"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"258","last_page":"269"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.28999999165534973,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.28999999165534973,"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.2395000010728836,"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.1704999953508377,"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/hypercube","display_name":"Hypercube","score":0.8481000065803528},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6680999994277954},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6579999923706055},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6172999739646912},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.520799994468689},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.47110000252723694},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.45080000162124634},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.44530001282691956}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.8481000065803528},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6952999830245972},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6680999994277954},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6579999923706055},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6172999739646912},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.520799994468689},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.47110000252723694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4587000012397766},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45419999957084656},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.45080000162124634},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4462999999523163},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.44530001282691956},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4415000081062317},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40310001373291016},{"id":"https://openalex.org/C80763892","wikidata":"https://www.wikidata.org/wiki/Q958394","display_name":"Hypercube graph","level":5,"score":0.3781999945640564},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.37709999084472656},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.36880001425743103},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.3118000030517578},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C69919132","wikidata":"https://www.wikidata.org/wiki/Q1144819","display_name":"Polyomino","level":3,"score":0.2630999982357025},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.26080000400543213}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-032-11835-6_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-11835-6_19","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"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/W1968921005","https://openalex.org/W1980811831","https://openalex.org/W2024863625","https://openalex.org/W2046815858","https://openalex.org/W2068462604","https://openalex.org/W2076809366","https://openalex.org/W2088131503","https://openalex.org/W2119911080","https://openalex.org/W2807496761","https://openalex.org/W2810992636","https://openalex.org/W4399889505","https://openalex.org/W4403861409"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-01-02T00:00:00"}