Constraining MC-numbers by the connectivity of complement graphs

DOI10.1016/j.disc.2023.113799zbMath1530.05050OpenAlexW4388839480MaRDI QIDQ6177407

No author found.

Publication date: 17 January 2024

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

Full work available at URL: https://doi.org/10.1016/j.disc.2023.113799

zbMATH Keywords

connectivitycomplement graphmonochromatic connection numbermonochromatic connection coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Unnamed Item
• Proper connection of graphs
• Monochromatic connecting colorings in strongly connected oriented graphs
• Extremal graphs with maximum monochromatic connectivity
• Rainbow monochromatic \(k\)-edge-connection colorings of graphs
• Hardness results for three kinds of colored connections of graphs
• Colorful monochromatic connectivity
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: Constraining MC-numbers by the connectivity of complement graphs