The proper vertex-disconnection of graphs

DOI10.1016/j.tcs.2022.05.004OpenAlexW4229019662MaRDI QIDQ2672620

You Chen, Xue Liang Li

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.05.004

zbMATH Keywords

polynomial time algorithmchromatic numbervertex-coloringvertex-cutNP-complete (hard)proper vertex-disconnection

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proper connection of graphs
• The rainbow vertex-disconnection in graphs
• Some simplified NP-complete graph problems
• Rainbow disconnection in graphs
• Complexity results for two kinds of colored disconnections of graphs
• Proper disconnection of graphs
• Further results on the rainbow vertex-disconnection of graphs
• Bounds for the rainbow disconnection numbers of graphs
• More on the rainbow disconnection in graphs
• Monochromatic disconnection: Erdős-Gallai-type problems and product graphs
• Monochromatic disconnection of graphs
• Note on the colouring of graphs
• Upper bounds for the \(M D\)-numbers and characterization of extremal graphs
• Map Colour Theorems Related To the Heawood Colour Formula
• Rainbow connection in graphs
• Reducibility among Combinatorial Problems
• Some Theorems on Abstract Graphs

This page was built for publication: The proper vertex-disconnection of graphs