Monochromatic connectivity and graph products

DOI10.1142/S1793830916500117zbMath1338.05145arXiv1505.01424MaRDI QIDQ2798325

Chengfu Ye, Fengnan Yanling, Yaping Mao, Zhao Wang

Publication date: 12 April 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.01424

zbMATH Keywords

graph productsmonochromatic pathmonochromatic connection

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Monochromatic disconnection: Erdős-Gallai-type problems and product graphs ⋮ Monochromatic \(k\)-edge-connection colorings of graphs ⋮ Rainbow monochromatic \(k\)-edge-connection colorings of graphs

Cites Work

• Unnamed Item
• Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
• Connectivity of Cartesian products of graphs
• The multi-tree approach to reliability in distributed networks
• Reliable broadcasting in product networks
• Rainbow connections of graphs: a survey
• Path-connectivity of lexicographic product graphs
• The rainbow connectivity of a graph
• Rainbow trees in graphs and generalized connectivity
• Rainbow connection in graphs
• The Number of Independent Sets in a Grid Graph
• Optimum broadcasting and personalized communication in hypercubes
• Small cycle double covers of products I: Lexicographic product with paths and cycles

This page was built for publication: Monochromatic connectivity and graph products