论文信息 - An algorithm for coloring some perfect graphs - 字舞流文

An algorithm for coloring some perfect graphs

Abstract We propose a sequential method with 3-chromatic interchange for coloring perfect graphs.

Sylvain Gravier | Frédéric Maffray | Hacène Aït Haddadène | Sylvain Gravier | Frédéric Maffray | H. A. Haddadène

[1] L. Lovász,et al. Polynomial Algorithms for Perfect Graphs , 1984 .

[2] Alan Tucker,et al. A reduction procedure for coloring perfect K4-free graphs , 1987, J. Comb. Theory, Ser. B.

[3] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[4] Alan Tucker. Coloring perfect (K4 - e)-free graphs , 1987, J. Comb. Theory, Ser. B.

[5] G. Dirac. On rigid circuit graphs , 1961 .

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

[7] Frédéric Maffray,et al. Coloring perfect degenerate graphs , 1997, Discret. Math..

[8] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[9] Sylvain Gravier,et al. On weakly diamond-free Berge graphs , 1996, Discret. Math..