Abstract
In this article we give a characterization of P₄-tidy graphs. We also give recognition algorithm for P₄-tidy graphs, comparable to existent ones as execution time. Finally, we determine the combinatorial optimization number in efficient time for P₄-tidy graphs. We show that for P4-tidy graphs clique problem is polynomial time.
Cuvinte cheie
P₄-tidy graphs
spider graphs
quasi-spider graphs
weak decomposition
recognition algorithm.