Relations of three classes of disconnected coloring

DOI10.1016/j.dam.2024.01.006zbMath1530.05051OpenAlexW4391067506MaRDI QIDQ6153478

No author found.

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Proper connection of graphs
• The complexity of determining the rainbow vertex-connection of a graph
• The rainbow vertex-disconnection in graphs
• Rainbow disconnection in graphs
• Total rainbow connection of digraphs
• Rainbow monochromatic \(k\)-edge-connection colorings of graphs
• Monochromatic vertex-disconnection colorings of graphs
• Monochromatic disconnection of graphs
• Colorful monochromatic connectivity
• Monochromatic \(k\)-edge-connection colorings of graphs
• On the complexity of \(k\)-rainbow cycle colouring problems
• Rainbow connection in graphs
• Reducibility among Combinatorial Problems
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

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