{"title":"次临界图类中的极值参数","authors":"M. Drmota, M. Noy","doi":"10.1137/1.9781611973037.1","DOIUrl":null,"url":null,"abstract":"We analyze several extremal parameters like the diameter or the maximum degree in sub-critial graph classes. Subcritical graph classes cover several well-known classes of graphs like trees, outerplanar graph or series-parallel graphs which have been intensively studied during the last few years. However, this paper is the first one, where these kinds of parameters are studied from a general point of view.","PeriodicalId":340112,"journal":{"name":"Workshop on Analytic Algorithmics and Combinatorics","volume":"172 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Extremal Parameters in Sub-Critical Graph Classes\",\"authors\":\"M. Drmota, M. Noy\",\"doi\":\"10.1137/1.9781611973037.1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We analyze several extremal parameters like the diameter or the maximum degree in sub-critial graph classes. Subcritical graph classes cover several well-known classes of graphs like trees, outerplanar graph or series-parallel graphs which have been intensively studied during the last few years. However, this paper is the first one, where these kinds of parameters are studied from a general point of view.\",\"PeriodicalId\":340112,\"journal\":{\"name\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"volume\":\"172 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-01-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/1.9781611973037.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":"Workshop on Analytic Algorithmics and Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611973037.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We analyze several extremal parameters like the diameter or the maximum degree in sub-critial graph classes. Subcritical graph classes cover several well-known classes of graphs like trees, outerplanar graph or series-parallel graphs which have been intensively studied during the last few years. However, this paper is the first one, where these kinds of parameters are studied from a general point of view.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
