Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time

Robert Carr. Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time. Math. Oper. Res., 22(2):257-265, 1997. [doi]

@article{Carr97-0,
  title = {Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time},
  author = {Robert Carr},
  year = {1997},
  doi = {10.1287/moor.22.2.257},
  url = {http://dx.doi.org/10.1287/moor.22.2.257},
  researchr = {https://researchr.org/publication/Carr97-0},
  cites = {0},
  citedby = {0},
  journal = {Math. Oper. Res.},
  volume = {22},
  number = {2},
  pages = {257-265},
}