Publisher
Springer Nature Switzerland
Reference13 articles.
1. Bandelt, H., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory Ser. B 41(2), 182–208 (1986). https://doi.org/10.1016/0095-8956(86)90043-2
2. Borodin, O.V., Glebov, A.N.: On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph (2001)
3. Buchsbaum, A.L., Carlisle, M.C.: Determining uni-connectivity in directed graphs. Inf. Process. Lett. 48(1), 9–12 (1993). https://doi.org/10.1016/0020-0190(93)90261-7
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)
5. Damiand, G., Habib, M., Paul, C.: A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theor. Comput. Sci. 263(1–2), 99–111 (2001). https://doi.org/10.1016/S0304-3975(00)00234-6