Strangulated graph

A **strangulated graph** is a concept in graph theory that refers to a specific type of graph structure characterized by certain properties that relate to connectivity and edge restrictions. In particular, a graph is said to be strangulated if it has a partitioning of its vertex set into two subsets such that all vertices in one subset have a fixed degree (typically a very low degree) while vertices in the other subset have a much higher degree.