最小无爪2连通不可迹图和极大不可迹图的构造

{"title":"最小无爪2连通不可迹图和极大不可迹图的构造","authors":"F. Bullock","doi":"10.1016/S9999-9994(06)20334-9","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":424132,"journal":{"name":"Journal of End-to-end-testing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs☆\",\"authors\":\"F. Bullock\",\"doi\":\"10.1016/S9999-9994(06)20334-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":424132,\"journal\":{\"name\":\"Journal of End-to-end-testing\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of End-to-end-testing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1016/S9999-9994(06)20334-9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of End-to-end-testing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/S9999-9994(06)20334-9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}