INFORMATICA International Journal Main Page Editorial Board Abstracting/Indexing Instructions to Authors Subscription Information Contents Author Index Papers in Production		INFORMATICA, 2007, Vol. 18, No. 3, 457-462 © Institute of Mathematics and Informatics, ISSN 0868-4952 Recognition Algorithm for Diamond-Free Graphs Mihai TALMACIU, Elena NECHITA Department of Mathematics and Informatics, University of Bacau 8 Spiru Haret str., 600114 Bacau, Romania E-mail: mihaitalmaciu@yahoo.com, elenechita@yahoo.com Abstract 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. Keywords: diamond graph, weakly decomposition, recognition algorithm To preview Lithuanian abstract see full article text To preview full article text in PDF format click here You could obtain free Acrobat Reader from Adobe
Top		Copyright © INFORMATICA, Vilnius University Institute of Mathematics and Informatics, 2010