Path parity and perfection

Discrete Mathematics

Volumn 165-166, Issue , 1997, Pages 233-252

  Everett, Hazel ^a   De Figueiredo, Celina M H ^b   Linhares Sales, Cláudia ^c,d   Maffray, Frédéric ^c   Porto, Oscar ^e   Reed, Bruce A ^f  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c CNRS LSD2   (France)

^d FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^e PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^f CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18244422704     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00174-4     Document Type: Article

References (48)

1. S.R. Arikati and U.N. Peled, A polynomial algorithm for the parity path problem on perfectly orientable graphs, Discrete Appl. Math. 65 (1996) 5-20.
2. S.R. Arikati and C. Pandu Rangan, An efficient algorithm for finding a two-pair, and its applications, Discrete Appl. Math. 31 (1991) 71-74.
3. C. Berge, Les problèmes de coloration en théorie des graphes, Publ. Inst. Statist. Univ. Paris 9 (1960) 123-160.
4. C. Berge and P. Duchet, Strongly perfect graphs, Ann. Discrete Math. 21 (1984) 57-62.
5. M.E. Bertschi, Perfectly contractile graphs, J. Combin. Theory Ser. B 50 (1990) 222-230.
6. M.E. Bertschi and B.A. Reed, A note on even pairs, Discrete Math. 65 (1987) 317-318.
7. D. Bienstock, On the complexity of testing for odd holes and odd induced paths, Discrete Math. 90 (1991) 85-92.
8. M. Burlet and J.P. Uhry, Parity graphs, Ann. Discrete Math. 21 (1984) 253-278.
9. V. Chvátal, Perfectly ordered graphs, Ann. Discrete Math. 21 (1984) 63-68.
10. V. Chvátal, Star cutsets, J. Combin. Theory Ser. B 39 (1985) 189-199.
11. V. Chvátal, A class of perfectly orderable graphs, Technical Report 89573-OR, Institut fuer Oekonometrie und Operations Research, Bonn, Germany, May 1989.
12. V. Chvátal, Which claw-free graphs are perfectly orderable ?, Discrete Appl. Math. 44 (1993) 39-63.
13. V. Chvátal and N. Sbihi, Bull-free Berge graphs are perfect, Graphs and Combin. 3 (1987) 127-139.
14. V. Chvátal and N. Sbihi, Recognizing claw-free perfect graphs, J. Combin. Theory Ser. B 44 (1988) 154-176.
15. C.M.H. de Figueiredo, F. Maffray and O. Porto, On the structure of bull-free perfect graphs, Estudos e Comunicações do Institute de Matemática, Universidade Federal do Rio de Janeiro, 1994, to appear in Graphs and Combin.
16. J. Fonlupt and J.P. Uhry, Transformations which preserve perfectness and h-perfectness of graphs, Ann. Discrete Math. 16 (1982) 83-85.
17. M. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
18. A. Gavril, Algorithms on clique-separable graphs, Discrete Math. 19 (1977) 159-165.
19. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
20. M. Grötschel, L. Lovász and A. Schrijver, Polynomial algorithms for perfect graphs, in: C. Berge and V. Chvátal, eds., Ann. Discrete Math. 21 (1984) 325-356.
21. R. Hayward, Weakly triangulated graphs, J. Combin. Theory Ser. B 39 (1985) 200-208.
22. R. Hayward, C .T. Hoàng and F. Maffray, Optimizing weakly triangulated graphs, Graphs and Combin. 6 (1990) 33-35.
23. A. Hertz, A fast algorithm for colouring Meyniel graphs, J. Combin. Theory Ser. B 50 (1990) 231-240.
24. A. Hertz and D. de Werra, Perfectly orderable graphs are quasi-parity graphs: a short proof, Discrete Math. 68 (1988) 111-113.
25. C.T. Hoàng, Alternating orientation and alternating colouration of perfect graphs, J. Combin. Theory Ser. B 42 (1987) 264-273.
26. C.T. Hoàng, On a conjecture of Meyniel, J. Combin. Theory Ser. B 42 (1987) 302-312.
27. C .T. Hoàng, Some properties of minimal imperfect graphs, Discrete Math. 160 (1996) 165-175.
28. C.T. Hoàng and F. Maffray, Weakly triangulated graphs are strict quasi-parity graphs, Rutcor Research Rpt., Rutgers Univ. 6-86 (1986).
29. S. Hougardy, Perfekte Graphen, Ph.D. Thesis, Institut für Ökonometrie und Operations Research, Universität Bonn, 1991.
30. S. Hougardy, Counterexamples to three conjectures concerning perfect graphs, Discrete Math. 117 (1993) 245-251.
31. W.L. Hsu, Recognizing planar perfect graphs, J. ACM 34 (1987) 255-288.
32. C. Linhares-Sales and F. Maffray, Even pairs in claw-free perfect graphs, Université Joseph Fourier, Grenoble, France, 1995, submitted.
33. C. Linhares-Sales, F. Maffray and B.A. Reed, On planar perfectly contractile graphs, Université Joseph Fourier, Grenoble, France, 1994, to appear in Graphs and Combin.
34. C. Linhares-Sales, F. Maffray and B.A. Reed, On planar quasi-parity graphs, Université Joseph Fourier, Grenoble, France, 1994, submitted.
35. L. Lovász, Normal hypergraphs and the perfect graph conjecture, Discrete Math. 2 (1972) 253-267.
36. F. Maffray, A description of claw-free perfect graphs, Université Joseph Fourier, Grenoble, France, 1995, submitted.
37. H. Meyniel, The graphs whose odd cycles have at least two chords, Ann. Discrete Math. 21 (1984) 115-120.
38. H. Meyniel, A new property of critical imperfect graphs and some consequences, European J. Combin. 8 (1987) 313-316.
39. H. Meyniel and S. Olariu, A new conjecture about minimal imperfect graphs, J. Combin. Theory Ser. B 47 (1989) 244-247.
40. M. Middendorf and F. Pfeiffer, On the complexity of recognizing perfectly orderable graphs, Discrete Math. 81 (1990) 327-333.
41. S. Olariu, No antitwins in minimal imperfect graphs, J. Combin. Theory Ser. B 45 (1988) 255-257.
42. 1,3-free graphs, J. Combin. Theory Ser. B 21 (1976) 212-223.
43. Problem session on parity problems, DIMACS Workshop on Perfect Graphs, Princeton University, NJ, June 1993.
44. B.A. Reed, Perfection, parity, planarity, and packing paths, in: R. Kannan and W.R. Pulleyblank, eds., Integer Programming and Combinatorial Optimization, Math. Program. Soc. (University of Waterloo Press, Waterloo, Canada, 1990) 407-419.
45. B.A. Reed and N. Sbihi, Recognizing bull-free perfect graphs, Graphs Combin. 11 (1995) 171-178.
46. I. Rusu, Building counterexamples, DIMACS Workshop on Perfect Graphs, Princeton University, NJ, June 1993.
47. I. Rusu, Quasi-parity and perfect graphs, Inform Process Lett. 54 (1995) 35-39.
48. A. Tucker, The strong perfect graph conjecture for planar graphs, Canad. J. Math. 25 (1973) 103-114.