论文信息 - P_4-laden Graphs: A New Class of Brittle Graphs

P_4-laden Graphs: A New Class of Brittle Graphs

Abstract We present a new family of graphs, the family of P4-laden graphs strictly containing the class of P4-lite graphs introduced in (Jamison and Olariu, 1989). We first show that P4-laden graphs are brittle and next, using modular decomposition we present for this class of graphs a linear recognition algorithm as well as linear algorithms for classical optimization problems.

Vassilis Giakoumakis | V. Giakoumakis

[1] Bruce A. Reed,et al. Some classes of perfectly orderable graphs , 1989, J. Graph Theory.

[2] Matthias MIDDENDORF,et al. On the complexity of recognizing perfectly orderable graphs , 1990, Discret. Math..

[3] Alejandro A. Schäffer. Recognizing brittle graphs: remarks on a paper of Hoàng and Khouzam , 1991, Discret. Appl. Math..

[4] Chính T. Hoàng,et al. On brittle graphs , 1988, J. Graph Theory.

[5] S. Olariu,et al. A New Class of Brittle Graphs , 1989 .

[6] V. Chvátal. Perfectly Ordered Graphs , 1984 .

[7] V. Chvátal,et al. Topics on perfect graphs , 1984 .

[8] T. Gallai. Transitiv orientierbare Graphen , 1967 .

[9] Jeremy P. Spinrad,et al. P4-Trees and Substitution Decomposition , 1992, Discret. Appl. Math..

[10] Jeremy P. Spinrad,et al. Linear-time modular decomposition and efficient transitive orientation of comparability graphs , 1994, SODA '94.

[11] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[12] Peter L. Hammer,et al. The splittance of a graph , 1981, Comb..

[13] Dominique de Werra,et al. Four classes of perfectly orderable graphs , 1987, J. Graph Theory.

[14] Michel Habib,et al. A New Linear Algorithm for Modular Decomposition , 1994, CAAP.