Vesna Iršič, Marusa Lekse, Mihael Pacnik, Petra Podlogar, M. Pracek
{"title":"大型2交临界图的支配数和独立数","authors":"Vesna Iršič, Marusa Lekse, Mihael Pacnik, Petra Podlogar, M. Pracek","doi":"10.26493/1855-3974.2853.b51","DOIUrl":null,"url":null,"abstract":"After $2$-crossing-critical graphs were characterized in 2016, their most general subfamily, large $3$-connected $2$-crossing-critical graphs, has attracted separate attention. This paper presents sharp upper and lower bounds for their domination and independence number.","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":"21 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Domination and independence number of large 2-crossing-critical graphs\",\"authors\":\"Vesna Iršič, Marusa Lekse, Mihael Pacnik, Petra Podlogar, M. Pracek\",\"doi\":\"10.26493/1855-3974.2853.b51\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"After $2$-crossing-critical graphs were characterized in 2016, their most general subfamily, large $3$-connected $2$-crossing-critical graphs, has attracted separate attention. This paper presents sharp upper and lower bounds for their domination and independence number.\",\"PeriodicalId\":8402,\"journal\":{\"name\":\"Ars Math. Contemp.\",\"volume\":\"21 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ars Math. Contemp.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26493/1855-3974.2853.b51\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ars Math. Contemp.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26493/1855-3974.2853.b51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Domination and independence number of large 2-crossing-critical graphs
After $2$-crossing-critical graphs were characterized in 2016, their most general subfamily, large $3$-connected $2$-crossing-critical graphs, has attracted separate attention. This paper presents sharp upper and lower bounds for their domination and independence number.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
