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

Michele Conforti, Gérard Cornuéjols. Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs. Journal of Combinatorial Theory, Series A, 87(2):300-330, 2003. [doi]

@article{ConfortiC03,
  title = {Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs},
  author = {Michele Conforti and Gérard Cornuéjols},
  year = {2003},
  doi = {10.1016/S0095-8956(02)00021-7},
  url = {http://dx.doi.org/10.1016/S0095-8956(02)00021-7},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ConfortiC03},
  cites = {0},
  citedby = {0},
  journal = {Journal of Combinatorial Theory, Series A},
  volume = {87},
  number = {2},
  pages = {300-330},
}