Monochromatic disconnection: Erdős-Gallai-type problems and product graphs

DOI10.1007/s10878-021-00820-3zbMath1498.05101arXiv1904.08583OpenAlexW3206377344MaRDI QIDQ2168716

Ping Li, Xue Liang Li

Publication date: 26 August 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

graph productsErdős-Gallai-type problemsmonochromatic disconnection (coloring) numbermonochromatic edge-cut

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Monochromatic vertex-disconnection colorings of graphs ⋮ The proper vertex-disconnection of graphs ⋮ Erdös-Gallai-type problems for distance-edge-monitoring numbers

Cites Work

• Unnamed Item
• Monochromatic connecting colorings in strongly connected oriented graphs
• Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
• Rainbow disconnection in graphs
• More on the colorful monochromatic connectivity
• Some extremal results on the colorful monochromatic vertex-connectivity of a graph
• Monochromatic disconnection of graphs
• Colorful monochromatic connectivity
• Erdős-Gallai-type results for total monochromatic connection of graphs
• The monochromatic connectivity of graphs
• Monochromatic connectivity and graph products
• Extremal graphs having no matching cuts
• The Kronecker Product of Graphs

This page was built for publication: Monochromatic disconnection: Erdős-Gallai-type problems and product graphs