具有小交叉数的最小次3的唯一哈密顿图

{"title":"具有小交叉数的最小次3的唯一哈密顿图","authors":"Benedikt Klocker, H. Fleischner, G. Raidl","doi":"10.1007/978-3-319-39636-1_1","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":307092,"journal":{"name":"International Workshop on Hybrid Metaheuristics","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers\",\"authors\":\"Benedikt Klocker, H. Fleischner, G. Raidl\",\"doi\":\"10.1007/978-3-319-39636-1_1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":307092,\"journal\":{\"name\":\"International Workshop on Hybrid Metaheuristics\",\"volume\":\"119 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Hybrid Metaheuristics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-39636-1_1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Hybrid Metaheuristics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-39636-1_1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}