Document Type

Article

Publication Date

1998

DOI

10.1016/s0166-218x(97)90120-7

Publication Title

Discrete Applied Mathematics

Volume

84

Issue

1-3

Pages

1-13

Abstract

We present new classes of graphs for which the isomorphism problem can be solved in polynomial time. These graphs are characterized by containing — in some local sense — only a small number of induced paths of length three. As it turns out, every such graph has a unique tree representation: the internal nodes correspond to three types of graph operations, while the leaves are basic graphs with a simple structure. The paper extends and generalizes known results about cographs, P4-reducible graphs, and P4-sparse graphs.

Comments

Elsevier open archive. Copyright © 1998 Published by Elsevier B.V. All rights reserved.

Original Publication Citation

Babel, L., & Olariu, S. (1998). On the structure of graphs with few P4s. Discrete Applied Mathematics, 84(1-3), 1-13. doi:10.1016/s0166-218x(97)90120-7

ORCID

0000-0002-3776-216X (Olariu)

Download

Share

COinS