Complexity results for two kinds of colored disconnections of graphs
暂无分享,去创建一个
Ping Li | Xueliang Li | Yindi Weng | You Chen
[1] J. A. Bondy,et al. Graph Theory , 2008, Graduate Texts in Mathematics.
[2] N. Alon. Restricted colorings of graphs , 1993 .
[3] Xueliang Li,et al. The Rainbow Vertex-disconnection in Graphs , 2018, Acta Mathematica Sinica, English Series.
[4] You Chen,et al. Complexity results for the proper disconnection of graphs , 2020, FAW.
[5] Xueliang Li,et al. Proper Disconnection of Graphs , 2019 .
[6] Xueliang Li,et al. Monochromatic disconnection of graphs , 2021, Discret. Appl. Math..
[7] Janosch Döcker,et al. On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat , 2019, ArXiv.
[8] Xueliang Li,et al. Monochromatic disconnection: Erdős-Gallai-type problems and product graphs , 2021, Journal of Combinatorial Optimization.
[9] Ping Zhang,et al. On proper-path colorings in graphs , 2016 .
[10] Janosch Döcker,et al. On a simple hard variant of Not-All-Equal 3-Sat , 2020, Theor. Comput. Sci..
[11] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[12] Augustine M. Moshi. Matching cutsets in graphs , 1989, J. Graph Theory.
[13] Garry L. Johns,et al. Rainbow connection in graphs , 2008 .
[14] Xueliang Li,et al. More on rainbow disconnection in graphs , 2018 .
[15] Xueliang Li,et al. Bounds for the Rainbow Disconnection Numbers of Graphs , 2020, Acta Mathematica Sinica, English Series.
[16] Gary Chartrand,et al. Rainbow Disconnection in Graphs , 2018, Discuss. Math. Graph Theory.
[17] Zsolt Tuza,et al. Proper connection of graphs , 2012, Discret. Math..
[18] Maurizio Patrignani,et al. The Complexity of the Matching-Cut Problem , 2001, WG.