Monochromatic connecting colorings in strongly connected oriented graphs

DOI10.1016/j.disc.2016.11.016zbMath1355.05108OpenAlexW2569249955MaRDI QIDQ507473

Diego González-Moreno, Mucuy-kak Guevara, Juan José Montellano-Ballesteros

Publication date: 6 February 2017

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

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

zbMATH Keywords

oriented graphcoloringstrong connectivitymonochromatic

Mathematics Subject Classification ID

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

Related Items

Monochromatic disconnection: Erdős-Gallai-type problems and product graphs, Constraining MC-numbers by the connectivity of complement graphs, Hardness results for three kinds of colored connections of graphs, Monochromatic \(k\)-edge-connection colorings of graphs, Rainbow monochromatic \(k\)-edge-connection colorings of graphs, Erdős-Gallai-type results for total monochromatic connection of graphs, Vertex-monochromatic connectivity of strong digraphs

Cites Work

• Unnamed Item
• Rainbow connection in oriented graphs
• Rainbow connection in some digraphs
• Colorful monochromatic connectivity
• Rainbow connection in graphs