Relations of three classes of disconnected coloring

DOI10.1016/J.DAM.2024.01.006MaRDI QIDQ6153478zbMATH OpenOpenAlexFDO

Authors

Publication date 14 February 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2024.01.006

zbMATH Keywords

complexitymonochromatic disconnection coloringmonochromatic vertex disconnection coloringweak monochromatic vertex disconnection coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Monochromatic vertex-disconnection colorings of graphs
• Monochromatic disconnection of graphs
• Upper bounds for the \(M D\)-numbers and characterization of extremal graphs
• Monochromatic disconnection: Erdős-Gallai-type problems and product graphs
• The proper vertex-disconnection of graphs

Cites work

• Colorful monochromatic connectivity
• Graph theory with applications
• Monochromatic \(k\)-edge-connection colorings of graphs
• Monochromatic disconnection of graphs
• Monochromatic vertex-disconnection colorings of graphs
• On proper-path colorings in graphs
• On the complexity of \(k\)-rainbow cycle colouring problems
• Proper connection of graphs
• Rainbow connection in graphs
• Rainbow disconnection in graphs
• Rainbow monochromatic \(k\)-edge-connection colorings of graphs
• Reducibility among combinatorial problems
• The complexity of determining the rainbow vertex-connection of a graph
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• The rainbow vertex-disconnection in graphs
• Total rainbow connection of digraphs

This page was built for publication: Relations of three classes of disconnected coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153478)