activity
20172021
collaborators

6 papers

math.CO2021

A characterization of --(vertex-)critical graphs

Jasmina Ferme

Given a graph , a function with the property that implies that the distance between and is greater than , is call…

math.CO2020

-packing colorings of distance graphs

Boštjan Brešar, Jasmina Ferme, Karolína Kamenická

Given a graph and a non-decreasing sequence of positive integers, the mapping is an -packing -coloring of if…

math.CO2020

Packing chromatic numbers of finite super subdivisions of graphs

Rachid Lemdani, Moncef Abbas, Jasmina Ferme

The \textit{packing chromatic number} of a graph , denoted by , is the smallest integer such that the vertex set of can be partitioned into sets , $i\in \…

math.CO2019

Graphs that are critical for the packing chromatic number

Boštjan Brešar, Jasmina Ferme

Given a graph , a coloring such that implies that vertices and are at distance greater than , is called a packing…

math.CO2018

An infinite family of subcubic graphs with unbounded packing chromatic number

Boštjan Brešar, Jasmina Ferme

Recently, Balogh, Kostochka and Liu in [Packing chromatic number of cubic graphs, Discrete Math.~341 (2018) 474--483] answered in negative the question that was posed in several ea…

math.CO2017

Packing coloring of Sierpiński-type graphs

Boštjan Brešar, Jasmina Ferme

The packing chromatic number of a graph is the smallest integer such that the vertex set of can be partitioned into sets , , where ea…