Sciweavers

Share
INFORMATICALT
2007

Recognition Algorithm for Diamond-Free Graphs

9 years 3 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 recognition algorithm for the diamond-free graphs which keeps the combinatorial structure of the graph by means of the decomposition, as well as an easy possibility to determine the clique number for the diamond-free graphs. Key words: diamond graph, weakly decomposition, recognition algorithm.
Mihai Talmaciu, Elena Nechita
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where INFORMATICALT
Authors Mihai Talmaciu, Elena Nechita
Comments (0)
books