Whitesides, S. H. An algorithm for finding clique cut-sets. (English) Zbl 0454.68078 Inf. Process. Lett. 12, 31-32 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 50 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 05C99 Graph theory PDFBibTeX XMLCite \textit{S. H. Whitesides}, Inf. Process. Lett. 12, 31--32 (1981; Zbl 0454.68078) Full Text: DOI References: [1] Gavril, F., Algorithms on clique separable graphs, Discrete Math., 19, 159-165 (1977) · Zbl 0378.05042 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.