Monochromatic vertex-disconnection colorings of graphs
From MaRDI portal
Publication:2147602
Recommendations
- Monochromatic disconnection: Erdős-Gallai-type problems and product graphs
- Monochromatic disconnection of graphs
- Further results on the rainbow vertex-disconnection of graphs
- The rainbow vertex-disconnection in graphs
- Rainbow vertex-connection and graph products
- Nordhaus-Gaddum-type bounds for the rainbow vertex-connection number of a graph
- More on the rainbow disconnection in graphs
- Rainbow and monochromatic vertex-connection of random graphs
- Bounds for the rainbow disconnection numbers of graphs
- Complexity results for two kinds of colored disconnections of graphs
Cites work
- Bounds for the rainbow disconnection numbers of graphs
- Complexity results for two kinds of colored disconnections of graphs
- Further results on the rainbow vertex-disconnection of graphs
- Graph theory
- Hardness results for three kinds of colored connections of graphs
- Monochromatic disconnection of graphs
- Monochromatic disconnection: Erdős-Gallai-type problems and product graphs
- More on the rainbow disconnection in graphs
- Rainbow disconnection in graphs
- The Kronecker Product of Graphs
- The rainbow vertex-disconnection in graphs
- Upper bounds for the \(M D\)-numbers and characterization of extremal graphs
Cited in
(5)
This page was built for publication: Monochromatic vertex-disconnection colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147602)