Discrete Mathematics & Theoretical Computer Science
Volume 4 n° 2 (2001), pp. 173-178
| author: | Michel Habib, Christophe Paul and Laurent Viennot |
|---|---|
| title: | Linear time recognition of P4-indifference graphs |
| keywords: | P4-indifference, algorithm, recognition |
| abstract: | A graph is a P4-indifference graph if it admits an ordering < on its vertices such that every chordless path with vertices a, b, c, d and edges ab, bc, cd has a<b<c<d or d<c<b<a. We present a linear time recognition for these graphs. |
| reference: | Michel Habib, Christophe Paul and Laurent Viennot (2001), Linear time recognition of P4-indifference graphs, Discrete Mathematics and Theoretical Computer Science 4, pp. 173-178 |
| ps.gz-source: | dm040209.ps.gz (23 K) |
| ps-source: | dm040209.ps (65 K) |
| pdf-source: | dm040209.pdf (60 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Automatically produced on Sat Sep 8 00:37:21 CEST 2001 by ifalk