On the packing chromatic number of vertex amalgamation of some related tree graph
SM Citra, AI Kristiana, R Adawiyah… - Journal of Physics …, 2021 - iopscience.iop.org
All graph in this paper is simple graph. Let G=(V, E) where V is nonempty of vertex set of G
and E is possibly empty set of unordered pairs of elements of V. The distance from u to v in G …
and E is possibly empty set of unordered pairs of elements of V. The distance from u to v in G …
Labeled Packing of Cycles and Circuits
A Joffard, H Kheddouci - arxiv preprint arxiv:1805.06171, 2018 - arxiv.org
In 2013, Duch {\^ e} ne, Kheddouci, Nowakowski and Tahraoui [4, 9] introduced a labeled
version of the graph packing problem. It led to the introduction of a new parameter for …
version of the graph packing problem. It led to the introduction of a new parameter for …