论文信息 - The Story of Perfectly Orderable Graphs - 字舞流文

The Story of Perfectly Orderable Graphs

We give the story behind one examplar of the work of Vašek Chvátal, namely his conception of the class of perfectly orderable graphs.

Ryan B. Hayward | R. Hayward

[1] V. Chvátal. On certain polytopes associated with graphs , 1975 .

[2] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[3] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[4] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[5] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[6] L. Lovász. A Characterization of Perfect Graphs , 1972 .

[7] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[8] Yuval Rabani,et al. Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

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

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

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

[12] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

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

[14] S. E. Markosyan,et al. ω-Perfect graphs , 1990 .

[15] O. H. Brownlee,et al. ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION , 1952 .

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