Matroids arisen from matrogenic graphs

Discrete Mathematics

Volumn 165-166, Issue , 1997, Pages 211-217

  Ding, Guoli ^a   Hammer, Peter L ^b  

^a LOUISIANA STATE UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041630692     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00171-9     Document Type: Article

References (9)

1. V. Chvátal and P.L. Hammer, Aggregation of inequalities in integer programming, Ann. Discrete Math. 1 (1977) 145-162.
2. D.G. Corneil, H. Lerchs and L.K. Stewart, Complement Reducible Graphs, Discrete Appl. Math. 3 (1981) 163-174.
3. S. Földes and P.L. Hammer, On a class of matroid-Producing graphs, Colloq. Math. Soc. Janos Bolyai, 18 Combinatorics, Keszthely (Hungary) (1976) 331-352.
4. 4-sparse graphs, in: Extended Abstract for the 4th Twente Workshop on Graphs and Combinatorial Optimization (1995).
5. M. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York 1980).
6. P.B. Henderson and Y. Zalcstein, A graph-theoretic characterization of the PV chunk class of synchronizing primitives, SIAM J. Comput. 6 (1977) 88-108.
7. C.T. Hoáng, Doctoral Dissertation, McGill University Montreal, 1985.
8. 4-sparse graphs, Discrete Applied Mathematics 35 (1992) 115-129.
9. U. Peled, Threshold graphs, Ann. Discrete Math. (1993).