{"title":"关于独特的可包装树木","authors":"A. Alochukwu, M. Dorfling, E. Jonck","doi":"10.2989/16073606.2024.2321259","DOIUrl":null,"url":null,"abstract":"An i-packing in a graph G is a set of vertices that are pairwise at distance more than i. A packing colouring of G is a partition X = {X1, X2, . . . , Xk } of V(G) such that each colour class Xi is...","PeriodicalId":49652,"journal":{"name":"Quaestiones Mathematicae","volume":"132 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On uniquely packable trees\",\"authors\":\"A. Alochukwu, M. Dorfling, E. Jonck\",\"doi\":\"10.2989/16073606.2024.2321259\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An i-packing in a graph G is a set of vertices that are pairwise at distance more than i. A packing colouring of G is a partition X = {X1, X2, . . . , Xk } of V(G) such that each colour class Xi is...\",\"PeriodicalId\":49652,\"journal\":{\"name\":\"Quaestiones Mathematicae\",\"volume\":\"132 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-03-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quaestiones Mathematicae\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2989/16073606.2024.2321259\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quaestiones Mathematicae","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2989/16073606.2024.2321259","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
图 G 中的 i 填充是成对距离大于 i 的顶点集合。, Xk } 的分区,使得每个颜色类 Xi 都是...
An i-packing in a graph G is a set of vertices that are pairwise at distance more than i. A packing colouring of G is a partition X = {X1, X2, . . . , Xk } of V(G) such that each colour class Xi is...
期刊介绍:
Quaestiones Mathematicae is devoted to research articles from a wide range of mathematical areas. Longer expository papers of exceptional quality are also considered. Published in English, the journal receives contributions from authors around the globe and serves as an important reference source for anyone interested in mathematics.