Perfect divisibility and 2‐divisibility
Perfect divisibility and 2‐divisibility
Abstract A graph G is said to be 2‐divisible if for all (nonempty) induced subgraphs H of G , can be partitioned into two sets such that and . (Here denotes the clique number of G , the number of vertices in a largest clique of G ). A graph …