On uniquely packable trees

IF 0.6 4区数学 Q3 MATHEMATICS

Quaestiones Mathematicae Pub Date : 2024-03-21 DOI:10.2989/16073606.2024.2321259

A. Alochukwu, M. Dorfling, E. Jonck

引用次数: 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...

查看原文本刊更多论文

关于独特的可包装树木

图 G 中的 i 填充是成对距离大于 i 的顶点集合。, Xk } 的分区，使得每个颜色类 Xi 都是...

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Quaestiones Mathematicae 数学-数学

CiteScore

1.70

自引率

0.00%

发文量

121

审稿时长

>12 weeks

期刊介绍： 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.