Benzaken, C., Boyd, S., Hammer, P.L., Simeone, B., Adjoints of pure hidirected graphs (1983) Congr. Numerantium, 39, pp. 123-144
Benzaken, C., Hammer, P.L., Simeone, B., Some remarks on conflict graphs of quadratic pseudo‐boolean functions (1980) Konstruktive Methoden der Finiten Nichtlinearen Optimierung, pp. 9-30. , L. Collatz et al., Birkhäuser,. Basel
Berge, C., (1973) Graphs and Hypergraphs, , North‐Holland,. Amsterdam
Edmonds, J., Johnson, E.L., Matching: A well‐solved class of integer linear programs (1970) Combinatorial Structures and their Applications, pp. 89-92. , R. Guy et al., Gordon & Breach,. New York
Garey, M.R., Johnson, D.S., (1979) Computers and Intractability: A Guide to the Theory of NP‐Completeness, , Freeman,. San Francisco
Hammer, P.L., Hansen, P., Simeone, B., Roof duality, complementation and persistency in quadratic 0–1 optimization (1984) Math. Program., 28, pp. 121-155
Hammer, P.L., Simeone, B., Quasimonotone boolean functions and bistellar graphs (1980) Ann. Discrete Math., 9, pp. 107-119
Johnson, E.L., Padberg, M.W., Degree‐two inequalities, clique facets, and biperfect graphs (1982) Ann. Discrete Math., 16, pp. 169-187
Lawler, E.L., (1976) Combinatorial Optimization: Networks and Matroids, , Holt, Rinehart & Winston,. New York
Lehot, P.G.H., An optimal algorithm to detect a line graph and output its root graph (1974) J. ACM, 21, pp. 569-575
Syseo, M.M., A labeling algorithm to recognize a line digraph and output its root graph (1982) Information Processing Letters, 15, pp. 28-30
Valdes, J., Tarjan, R.E., Lawler, E.L., (1979), pp. 1-12. , The recognition of series parallel digraphs. In Proc. 11th Annual ACM Symposium on Theory of Computing, pp
Yannakakis, M., (1978), pp. 253-264. , Node‐ and edge‐deletion NP‐complete problems. In Proc. 10th Annual ACM Symposium on Theory of Computing, pp
