Complexity Results for the Proper Disconnection of Graphs

You Chen, Ping Li, Xueliang Li, Yindi Weng. Complexity Results for the Proper Disconnection of Graphs. In Minming Li, editor, Frontiers in Algorithmics - 14th International Workshop, FAW 2020, Haikou, China, October 19-21, 2020, Proceedings. Volume 12340 of Lecture Notes in Computer Science, pages 1-12, Springer, 2020. [doi]

@inproceedings{ChenLLW20-1,
  title = {Complexity Results for the Proper Disconnection of Graphs},
  author = {You Chen and Ping Li and Xueliang Li and Yindi Weng},
  year = {2020},
  doi = {10.1007/978-3-030-59901-0_1},
  url = {https://doi.org/10.1007/978-3-030-59901-0_1},
  researchr = {https://researchr.org/publication/ChenLLW20-1},
  cites = {0},
  citedby = {0},
  pages = {1-12},
  booktitle = {Frontiers in Algorithmics - 14th International Workshop, FAW 2020, Haikou, China, October 19-21, 2020, Proceedings},
  editor = {Minming Li},
  volume = {12340},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-59901-0},
}