| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653150 | Electronic Notes in Discrete Mathematics | 2006 | 8 Pages |
Abstract
A linear algorithm for domino and linear domino recognition and constructing the list of maximal cliques of such graphs is proposed. Unlike the algorithm in [Kloks, T., D. Kratsch and H. Muller, Dominoes, Workshop on Graph-Theoretic Concepts in Computer Science, 1994, 106–120] it doesn't require preliminary analysis of a graph. The characterizations of a domino and a linear domino are given in term of special clique covering existence.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
