Colorful monochromatic connectivity

DOI10.1016/J.DISC.2011.04.020MaRDI QIDQ2275401zbMATH OpenOpenAlexFDO

Authors Yair Caro, Raphael Yuster

Publication date 8 August 2011

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

coloringconnectivitymonochromatic

Mathematics Subject Classification ID

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

Recommendations

• Extremal graphs with maximum monochromatic connectivity
• Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
• The monochromatic connectivity of graphs
• Monochromatic \(k\)-edge-connection colorings of graphs
• More on the colorful monochromatic connectivity

Cites work

• Hardness and Algorithms for Rainbow Connectivity
• On rainbow connection
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

Cited in

(31)

• More on the colorful monochromatic connectivity
• Some extremal results on the colorful monochromatic vertex-connectivity of a graph
• The (vertex-)monochromatic index of a graph
• Rainbow monochromatic \(k\)-edge-connection colorings of graphs
• Rainbow and monochromatic vertex-connection of random graphs
• Monochromatic disconnection: Erdős-Gallai-type problems and product graphs
• Further results on the total monochromatic connectivity of graphs
• Hardness results for three kinds of colored connections of graphs
• Monochromatic disconnection of graphs
• Multicolorful connectivity of trees
• Monochromatic \(k\)-edge-connection colorings of graphs
• (Strong) conflict-free connectivity: algorithm and complexity
• Erdős-Gallai-type results for total monochromatic connection of graphs
• Total monochromatic connection of graphs
• Upper bounds for the \(M D\)-numbers and characterization of extremal graphs
• The monochromatic connectivity of graphs
• Monochromatic connectivity and graph products
• Monochromatic connectivity in monochromatic-star-free graphs
• Bounds of the number of IMP-sets in edge-coloured graphs
• More on total monochromatic connection of graphs.
• Monochromatic connecting colorings in strongly connected oriented graphs
• Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
• The Monochromatic Circumference of 2‐Edge‐Colored Graphs
• Relations of three classes of disconnected coloring
• Constraining MC-numbers by the connectivity of complement graphs
• A survey on conflict-free connection coloring of graphs
• Monochromatic k-connection of graphs
• On \(\mathcal{P}\) vertex-connections of graphs
• Extremal graphs and classification of planar graphs by MC-numbers
• Extremal graphs with maximum monochromatic connectivity
• Vertex-monochromatic connectivity of strong digraphs

This page was built for publication: Colorful monochromatic connectivity

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