Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs-Reference-Cited by-同舟云学术

Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs

Published:2003-03 Issue:2 Volume:87 Page:300-330
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

Conforti Michele,Cornuéjols Gérard

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference14 articles.

1. C. Berge, Färbung von Graphen deren sämtliche bzw. deren ungerade Kreise starr sind (Zusammenfassung), Wiss. Z., Martin-Luther Univ. Halle-Wittenberg, Math. Natur. Reihe (1961) 114–115.

2. Polynomial algorithm to recognize a Meyniel graph;Burlet;Annals of Discrete Math.,1984

3. M. Chudnovsky, N. Robertson, P. Seymour, R. Thomas, The strong perfect graph theorem, preprint (2002).

4. Star cutsets and perfect graphs;Chvátal;J. Combin. Theory B,1985

5. Perfect graphs, partitionable graphs and cutsets;Conforti;Combinatorica,2002

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

1. Hereditary Efficiently Dominatable Graphs;Journal of Graph Theory;2012-07-16

2. On graphs with no induced subdivision of K4;Journal of Combinatorial Theory, Series B;2012-07

3. Graphs of separability at most 2;Discrete Applied Mathematics;2012-04

4. Graphs of Separability at Most Two: Structural Characterizations and Their Consequences;Lecture Notes in Computer Science;2011

5. The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution;Discrete Mathematics;2009-10