Here we study the Radon number for the P 3-convexity on graphs. P 3-convexity has been proposed in connection with rumour and disease spreading processes in ...

Jan 12, 2024 · Here we study the Radon number for the P 3 -convexity on graphs. A set R of vertices of a graph G is P 3 -convex if no vertex in V(G)∖R has two ...

Here we study the Radon number for the P3-convexity on graphs. P3-convexity has been proposed in connection with rumour and disease spreading processes in ...

We establish hardness results, describe efficient algo- rithms for trees, and prove a best-possible bound on the Radon number of connected graphs. Keywords: ...

The Radon number for the P3-convexity on graphs is studied, hardness results are established, efficient algorithms for trees are described, ...

Aug 28, 2012 · The P 3 -Radon number r ( G ) of a graph G is the smallest integer r such that every set R of r vertices of G has a partition R = R 1 ∪ R 2 such ...

Here we study the Radon number for the P 3 -convexity on graphs.A set R of vertices of a graph G is P 3 -convex if no vertex in V ( G ) R has two neighbours in ...

Here we study the Radon number for the P 3-convexity on graphs. P 3-convexity has been proposed in connection with rumour and disease spreading processes in ...

The Radon number for the P3-convexity on graphs, proposed in connection with rumour and disease spreading processes in networks, is studied and ...

Here we study the Radon number for the P 3 -convexity on graphs. P 3 -convexity has been proposed in connection with rumour and disease spreading processes ...