Sciweavers

INFORMATICALT
2007
80views more  INFORMATICALT 2007»
13 years 11 months ago
Recognition Algorithm for Diamond-Free Graphs
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognit...
Mihai Talmaciu, Elena Nechita