Monochromatic vertex-disconnection colorings of graphs
DOI10.1007/S40840-022-01284-2zbMATH Open1496.05049OpenAlexW4226016847MaRDI QIDQ2147602FDOQ2147602
Authors: Yanhong Gao, Xueliang Li
Publication date: 20 June 2022
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-022-01284-2
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
graph productsNordhaus-Gaddum-type resultmonochromatic vertex-cutmonochromatic vertex-disconnection coloring number
Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Structural characterization of families of graphs (05C75)
Cites Work
- Graph theory
- The Kronecker Product of Graphs
- Bounds for the rainbow disconnection numbers of graphs
- Rainbow disconnection in graphs
- Further results on the rainbow vertex-disconnection of graphs
- More on the rainbow disconnection in graphs
- The rainbow vertex-disconnection in graphs
- Hardness results for three kinds of colored connections of graphs
- Complexity results for two kinds of colored disconnections of graphs
- Monochromatic disconnection of graphs
- Monochromatic disconnection: Erdős-Gallai-type problems and product 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)