to strangulated graphs, the edge deletion step is omitted. A clique-sum of this type between two strangulated graphs results in another strangulated graph...
3 KB (340 words) - 21:48, 6 July 2022
greater than three Pseudoforest, a graph in which each connected component has at most one cycle Strangulated graph, a graph in which every peripheral cycle...
15 KB (1,857 words) - 03:10, 25 February 2025
faces, so maximal planar graphs are strangulated. The strangulated graphs include also the chordal graphs, and are exactly the graphs that can be formed by...
35 KB (4,541 words) - 05:33, 4 April 2025
cycles. Strangulated graphs are graphs that can be formed by clique-sums of chordal graphs and maximal planar graphs. Therefore, strangulated graphs include...
19 KB (2,164 words) - 07:51, 18 July 2024
maximum degree. Strangulated graph, a graph in which every peripheral cycle is a triangle Trotter, L. E. Jr. (1977), "Line perfect graphs", Mathematical...
3 KB (300 words) - 21:20, 27 March 2024
Clique-sum (category Graph operations)
decomposition of chordal graphs or strangulated graphs, no edges should be removed. In other contexts, such as the SPQR-tree decomposition of graphs into their 3-vertex-connected...
10 KB (1,178 words) - 04:08, 25 September 2024
Peripheral cycle (category Graph theory objects)
in linear time. Generalizing chordal graphs, Seymour & Weaver (1984) define a strangulated graph to be a graph in which every peripheral cycle is a triangle...
11 KB (1,503 words) - 13:17, 1 June 2024