论文信息 - Paw-Fee Graphs

Paw-Fee Graphs

Abstract We give decomposition theorem for a class of graphs and show how this theorem suggests efficient algorithms to optimize this class of graphs.

Stephan Olariu | S. Olariu

[1] M. Burlet,et al. Polynomial algorithm to recognize a Meyniel graph , 1984 .

[2] Vasek Chvátal,et al. Recognizing claw-free perfect graphs , 1987, J. Comb. Theory, Ser. B.

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

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

[5] P. Duchet,et al. Strongly Perfect Graphs , 1984 .

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

[7] Lorna Stewart,et al. A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..