The following pages link to Rainbow disconnection in graphs (Q1656915):
Displaying 15 items.
- The rainbow vertex-disconnection in graphs (Q831025) (← links)
- Complexity results for two kinds of colored disconnections of graphs (Q2045036) (← links)
- Proper disconnection of graphs (Q2045273) (← links)
- Further results on the rainbow vertex-disconnection of graphs (Q2049030) (← links)
- Bounds for the rainbow disconnection numbers of graphs (Q2115196) (← links)
- Monochromatic vertex-disconnection colorings of graphs (Q2147602) (← links)
- More on the rainbow disconnection in graphs (Q2158198) (← links)
- Monochromatic disconnection: Erdős-Gallai-type problems and product graphs (Q2168716) (← links)
- Monochromatic disconnection of graphs (Q2208356) (← links)
- Strong conflict-free connection of graphs (Q2284053) (← links)
- Upper bounds for the \(M D\)-numbers and characterization of extremal graphs (Q2661209) (← links)
- The proper vertex-disconnection of graphs (Q2672620) (← links)
- (Q5228101) (← links)
- The core of a complementary prism (Q6083960) (← links)
- Relations of three classes of disconnected coloring (Q6153478) (← links)