Intersection representations of matrices by subtrees and unicycles on graphs

Aho, 1974 Bernstein, 1981, Power of natural semijoins, SIAM J. Comput., 10, 751, 10.1137/0210059 Berry, 2006, Maximal sub-triangulation in preprocessing phylogenetic data, Soft Comput., 10, 461, 10.1007/s00500-005-0507-7 Buneman, 1974, A characterization of rigid circuit graphs, Discrete Math., 9, 205, 10.1016/0012-365X(74)90002-8 Duchet, 1984, Classical perfect graphs, 67 Frederickson, 1988, Planar linear arrangements of outerplanar graphs, IEEE Trans. Circuits Syst., 35, 323, 10.1109/31.1745 Fulkerson, 1965, Incidence matrices and interval graphs, Pacific J. Math., 15, 835, 10.2140/pjm.1965.15.835 Gavril, 1974, Algorithms on circular-arc graphs, Networks, 4, 357, 10.1002/net.3230040407 Gavril, 1974, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combin. Theory Ser. B, 16, 47, 10.1016/0095-8956(74)90094-X Gavril, 1975, A recognition algorithm for the intersection graphs of directed paths in directed trees, Discrete Math., 13, 237, 10.1016/0012-365X(75)90021-7 Gavril, 1978, A recognition algorithm for the intersection graphs of paths in trees, Discrete Math., 23, 211, 10.1016/0012-365X(78)90003-1 Gavril, 1987, Generating the maximum spanning trees of a weighted graph, J. Algorithms, 8, 592, 10.1016/0196-6774(87)90053-8 Gavril, 1996, Intersection graphs of Helly families of subgraphs, Discrete Appl. Math., 66, 45, 10.1016/0166-218X(94)00136-2 Gavril, 1994, Intersection graphs of concatenable subtrees of graphs, Discrete Appl. Math., 52, 195, 10.1016/0166-218X(94)90081-7 Held, 1970, The traveling-salesman problem and minimum spanning trees, Oper. Res., 18, 1138, 10.1287/opre.18.6.1138 Kaplan, 2006, A simpler linear-time recognition algorithm of circular-arc graphs, vol. 4059, 41 Kruskal, 1956, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Am. Math. Soc., 1, 48, 10.1090/S0002-9939-1956-0078686-7 Lueker, 1976, Testing for the consecutive ones property, interval graphs and graph planarity using PQ-algorithms, J. Comput. System Sci., 13, 335, 10.1016/S0022-0000(76)80045-1 Lustig, 1999, Acyclic hypergraphs projections and relationships to circular-arc graphs, J. Algorithms, 30, 400, 10.1006/jagm.1998.0965 R.M. McConnell, Linear-time recognition of circular-arc graphs, in: Proc. 42nd IEEE Symp. on Foundations of Computer Science, FOCS'01, vol. 42, 2001, pp. 386–394 Pevzner, 2000 Roberts, 1976 Schaffer, 1993, A faster algorithm to recognize undirected path graphs, Discrete Appl. Math., 43, 261, 10.1016/0166-218X(93)90116-6 Semple, 2006, Unicyclic networks: compatibility and enumeration, IEEE/ACM Trans. Comp. Biol. Bioinf., 3, 84, 10.1109/TCBB.2006.14 Spinrad, 1994, Recognition of circle graphs, J. Algorithms, 16, 264, 10.1006/jagm.1994.1012 Tucker, 1971, Matrix characterizations of circular-arc graphs, Pacific J. Math., 38, 535, 10.2140/pjm.1971.39.535 Quillot, 1984, A circular representation problem on hypergraphs, Discrete Math., 51, 251, 10.1016/0012-365X(84)90006-2 Zotenko, 2006, Decomposition of overlapping protein complexes: A graph theoretical method for analyzing static and dynamic protein, Algorithms for Molecular Biology, 1, 10.1186/1748-7188-1-7