The following publications are possibly variants of this publication:
- Conflict-Free Connection Number and Size of GraphsTrung Duy Doan, Ingo Schiermeyer. gc, 37(5):1859-1871, 2021. [doi]
- The Conflict-Free Vertex-Connection Number and Degree Conditions of GraphsTrung Duy Doan, Pham Hoang Ha, Ingo Schiermeyer. gc, 38(5):157, 2022. [doi]
- (1, 2)-rainbow connection number at most 3 in connected dense graphsTrung Duy Doan, Le Thi Duyen. ejgta, 11(2):411-417, 2023. [doi]
- Graphs with Conflict-Free Connection Number TwoHong Chang, Trung Duy Doan, Zhong Huang, Stanislav Jendrol', Xueliang Li, Ingo Schiermeyer. gc, 34(6):1553-1563, 2018. [doi]