论文信息 - On graphs without P5 and P5_

On graphs without P5 and P5_

Abstract We extend results due to Blazsik et al. (1993) on graphs with no induced C 4 and 2 K 2 to the self-complementary class of ( P 5 , P 5 )- free graphs. Moreover, we obtain an O(ω 2 ) γ -binding function for this last class of graphs, answering thus partially a question of A. Gyarfas.

[1] Jeremy P. Spinrad. Prime Testing for the Split Decomposition of a Graph , 1989, SIAM J. Discret. Math..

[2] A. Gyárfás. Problems from the world surrounding perfect graphs , 1987 .

[3] Zsolt Tuza,et al. Graphs with no induced C4 and 2K2 , 1993, Discret. Math..

[4] Jean-Luc Fouquet. A decomposition for a class of (P5, P5_5)-free graphs , 1993, Discret. Math..

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

[6] Henry Meyniel,et al. A New Property of Critical Imperfect Graphs and some Consequences , 1987, Eur. J. Comb..

[7] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .

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

[9] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .