Bounds for the rainbow disconnection numbers of graphs

DOI10.1007/s10114-022-0642-4OpenAlexW4214538463MaRDI QIDQ2115196

Zhong Huang, Xue Liang Li, Xu Qing Bai

Publication date: 15 March 2022

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

edge-coloringline graphedge-connectivityrainbow disconnection coloring (number)

Mathematics Subject Classification ID

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

Related Items (2)

Monochromatic vertex-disconnection colorings of graphs ⋮ The proper vertex-disconnection of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some criteria for a graph to be class 1
• The rainbow vertex-disconnection in graphs
• Two conjectures on edge-colouring
• Rainbow disconnection in graphs
• Rainbow connections of graphs: a survey
• Further results on the rainbow vertex-disconnection of graphs
• Ein Extremalproblem des Zusammenhangs von Graphen
• Maximal Flow Through a Network
• Rainbow connection in graphs
• The NP-Completeness of Edge-Coloring
• A Theorem on Coloring the Lines of a Network

This page was built for publication: Bounds for the rainbow disconnection numbers of graphs