Balanceable and Simply Balanceable Regular Graphs: Characterization and Complexity Analysis

Balanceable and simply balanceable regular graphs are characterized based on the independence number, leading to different recognition complexities for various degrees.