Complexity results for two kinds of colored disconnections of graphs

You Chen, Ping Li 0025, Xueliang Li 0001, Yindi Weng. Complexity results for two kinds of colored disconnections of graphs. J. Comb. Optim., 42(1):40-55, 2021. [doi]

Authors

You Chen

This author has not been identified. Look up 'You Chen' in Google

Ping Li 0025

This author has not been identified. Look up 'Ping Li 0025' in Google

Xueliang Li 0001

This author has not been identified. Look up 'Xueliang Li 0001' in Google

Yindi Weng

This author has not been identified. Look up 'Yindi Weng' in Google