Testing balancedness and perfection of linear matrices-Reference-Cited by-同舟云学术

Testing balancedness and perfection of linear matrices

Published:1993-08 Issue:1-3 Volume:61 Page:1-18
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Conforti Michele,Rao M. R.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01582135.pdf

Reference18 articles.

1. C. Berge, “Farbung von graphen, deren samtliche bzw. deren ungerade kreise star sind (Zusammenfassung),” Will. Z. Martin Luther University, Halle Wittenberg Math. Natur. Reihe (1961) 114.

2. C. Berge, “Balanced matrices”,Mathematical Programming 2 (1972) 19–31.

3. V. Chvátal, “On certain polytopes associated with graphs,”Journal of Combinatorial Theory, Series B 18 (1975) 138–154.

4. M. Conforti, “Diamond free perfect graphs and star cutsets,” in: B. Simeone, ed.,Lecture Notes in Mathematics (Springer, Berlin, 1990).

5. M. Conforti and M.R. Rao, “Articulation sets in linear perfect matrices and hypergraphs II: The wheel theorem and clique articulations,” (1986), to appear in:Discrete Mathematics.

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Detecting an Odd Hole;Journal of the ACM;2020-02-29

2. Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths;SIAM Journal on Discrete Mathematics;2015-01

3. Combinatorial Optimization;Computing Handbook, Third Edition;2014-05-08

4. Structural Graph Theory;Discrete Mathematics and Its Applications;2013-11-26

5. Decomposition of even-hole-free graphs with star cutsets and 2-joins;Journal of Combinatorial Theory, Series B;2013-01