On the \(\rho \)-edge stability number of graphs

DOI10.7151/DMGT.2255zbMath1479.05110OpenAlexW2984413793MaRDI QIDQ2062684

Massimiliano Marangio, Arnfried Kemnitz

Publication date: 3 January 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2255

zbMATH Keywords

edge coloringinvariantchromatic indexchromatic edge stability indexedge stability numberline stability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

On the chromatic vertex stability number of graphs ⋮ On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs ⋮ A Gallai’s Theorem type result for the edge stability of graphs ⋮ On the edge chromatic vertex stability number of graphs ⋮ On the vertex stability numbers of graphs

Cites Work

• 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
• The chromatic index of graphs with a spanning star

This page was built for publication: On the \(\rho \)-edge stability number of graphs