On edge perfectness and classes of bipartite graphs

Discrete Mathematics

Volumn 149, Issue 1-3, 1996, Pages 159-187

  Müller, Haiko ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043190002     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(94)00350-R     Document Type: Article

References (33)

1. A. d'Atri and M. Moscarini, Distance-hereditary graphs, Steiner trees, and connected domination, SIAM J. Comput. 17 (1988) 521-538.
2. H.-J. Bandelt and H.M. Mulder, Distance-hereditary graphs, J. Combin. Theory Ser. B 41 (1986) 182-208.
3. A. Brandstädt, Special graph classes - a survey, TR SM-DU-199 Universität GH, Duisburg, 1993.
4. C. Berge and V. Chvatál, eds., Topics on perfect graphs, Ann. Discrete Math. 21 (1984).
5. G.J. Chang and G.L. Nemhauser, Covering, packing and generalized perfection, SIAM J. Algebraic Discrete Methods 6 (1985) 109-132.
6. G. Chaty and M. Chein, Ordered matching and matching without alternating cycles in bipartite graphs, Utilitas Math. 9 (1979) 183-187.
7. V. Chvatál, Star-cutsets and perfect graphs, J. Combin. Theory Ser. B 39 (1985) 189-199.
8. i-perfect graphs, J. Graph Theory 11 (1987) 569-584.
9. D.G. Corneil and J. Fonlupt, Stable set bounding in perfect and parity graphs, J. Combin. Theory Ser. B 59 (1993) 1-14.
10. E. Dahlhaus, The computation of the jump number of convex graphs, Proc. ORDAL'94, Lecture Notes in Computer Science, Vol. 813 (Springer, Berlin 1994) 176-185.
11. M. Farber, Characterizations of strongly chordal graphs, Discrete Math. 43 (1983) 173-189.
12. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
13. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York 1980).
14. M. Grötschel, L. Lovász and A. Schrijver, Polynomial algorithms for perfect graphs, Ann. Discrete Math. 21 (1984) 325-356.
15. P.L. Hammer, F. Maffray and M. Preissmann, A characterization of chordal bipartite graphs, RUTCOR Research Report #16-89, RUTCOR New Brunswick, NJ 1989.
16. R. Hayward, Weakly triangulated graphs, J. Combin. Theory Ser B 39 (1985) 200-209.
17. R. Hayward, C. Hoàng and F. Maffray, Optimizing weakly triangulated graphs, Graphs Combin. 5 (1990) 339-349; and 6 (1990) 33-35.
18. R. Hayward, C. Hoàng and F. Maffray, Optimizing weakly triangulated graphs, Graphs Combin. 5 (1990) 339-349; and 6 (1990) 33-35.
19. I. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981) 718-720.
20. E. Howorka, A characterization of distance-hereditary graphs, The Quart. J. Math. 28 (1977) 417-420.
21. J. Lehel and Zs. Tuza, Neighborhood perfect graphs. Discrete Math. 61 (1986) 93-101.
22. D. Lichtenstein, Planar formulae and their uses, SIAM J. Comput. 11 (1982) 329-343.
23. L. Lovász, Normal Hypergraphs and the perfect graph conjecture. Discrete Math. 2 (1972) 253-267.
24. H. Müller, Alternating cycle-free matchings, Order 7 (1990) 11-21.
25. F. Nicolai, Verallgemeinerte Perfektheit auf Graphen, Diploma Thesis, Friedrich-Schiller-Universität, Jena, 1990.
26. E. Olaru, Beiträge zur Theorie der perfekten Graphen, Elektronische Inform. Kybernetik 8 (1972) 147-172.
27. J. Orlin, Containment in Graph Theory: Covering graphs with cliques, Nederl. Akad. Wetensch. Indag. Math. 39 (1977) 211-218.
28. J. Spinrad, A. Brandstädt and L. Stewart, Bipartite Permutation Graphs, Discrete Appl. Math. 18 (1987) 279-292.
29. G. Steiner and L. Stewart, A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders, Order 3 (1987) 359-369.
30. L.E. Trotter, Line perfect graphs, Math. Programming 12 (1977) 255-259.
31. A. Tucker, Coloring graphs with stable cutsets, J. Combin. Theory Ser. B 34 (1983) 258-267.
32. 4-free graphs, Ann. Discrete Math. 21 (1984) 140-157.
33. M. Yannakakis, Node-deletion problems on bipartite graphs, SIAM J. Comput. 10 (1981) 310-327.