{"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":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2989/16073606.2024.2321259","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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...