On complete intersection toric ideals of graphs (Q364718)

In the paper under review the authors try to characterize complete intersection toric ideals of a general simple graph \(G\). It is clear that they can assume the graph connected. A cut vertex of \(G\) is a vertex such that when you deleted it, \(G\) becomes disconnect. A connected subgraph without cut points is called a block. The main result in this paper is: If the toric ideal \(I_G\) associated to the graph \(G\) is a complete intersection then at most two blocks of \(G\) are non bipartite. Moreover the toric ideal \(I_G\) is generated by circuits.