2 citations · 5 across the 11 of their papers we have counts for
7 papers · 1 filter
(Eternal) Vertex Cover Number of Infinite and Finite Grid Graphs
Tiziana Calamoneri, Federico Corò
In the eternal vertex cover problem, mobile guards on the vertices of a graph are used to defend it against an infinite sequence of attacks on its edges by moving to neighbor verti…
All Graphs with at most 8 nodes are 2-interval-PCGs
Tiziana Calamoneri, Angelo Monti, Fabrizio Petroni
A graph G is a multi-interval PCG if there exist an edge weighted tree T with non-negative real values and disjoint intervals of the non-negative real half-line such that each node…
Some classes of graphs that are not PCGs
Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti +1
A graph is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and two non-negative real numbers and , $d_{min} \leq d_{max}…
On Pairwise Compatibility of Some Graph (Super)Classes
Tiziana Calamoneri, Blerina Sinaimeri, Mattia Gastaldello
A graph G=(V,E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers `d' and `D' such that each leaf `u' of T is a node…
All graphs with at most seven vertices are Pairwise Compatibility Graphs
Tiziana Calamoneri, Dario Frascaria, Blerina Sinaimeri
A graph is called a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and two non-negative real numbers and such that each leaf $…
On relaxing the constraints in pairwise compatibility graphs
Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri
A graph is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree and two non-negative real numbers and such that each leaf $…
The L(2, 1)-Labeling Problem on Oriented Regular Grids
Tiziana Calamoneri
The L(2, 1)-labeling of a digraph G is a function f from the node set of to the set of all nonnegative integers such that if and are at distance 1,…