Recognition Algorithm for Diamond-Free Graphs

Authors:
Mihai Talmaciu;Elena Nechita
Affiliations:
Department of Mathematics and Informatics, University of Bacău, 8 Spiru Haret str., 600114 Bacău, Romania, e-mail: mihaitalmaciu@yahoo.com, elenechita@yahoo.com;Department of Mathematics and Informatics, University of Bacău, 8 Spiru Haret str., 600114 Bacău, Romania, e-mail: mihaitalmaciu@yahoo.com, elenechita@yahoo.com
Venue:
Informatica
Year:
2007

Citing 1
Cited 3

(P5,diamond)-free graphs revisited: structure and linear time optimization

Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)

Graph-Based Data Clustering with Overlaps

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Arboricity, h-index, and dynamic algorithms

Theoretical Computer Science
Graph-based data clustering with overlaps

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

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.