A Gallai’s Theorem type result for the edge stability of graphs

DOI10.47443/dml.2023.088WikidataQ122946569 ScholiaQ122946569MaRDI QIDQ6063845

Massimiliano Marangio, Arnfried Kemnitz

Publication date: 12 December 2023

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

zbMATH Keywords

graph invariantGallai's theoremedge stability number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

On the vertex stability numbers of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination alteration sets in graphs
• On the chromatic edge stability number of graphs
• On bondage numbers of graphs: a survey with some comments
• Nordhaus-Gaddum and other bounds for the chromatic edge-stability number
• On the \(\rho \)-edge stability number of graphs
• Critical graphs for the chromatic edge-stability number
• On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs