On the ρ-Edge Stability Number of Graphs

Discussiones Mathematicae Graph Theory

Kemnitz Arnfried¹  Marangio Massimiliano¹ 

[1] Computational Mathematics, Technical University Braunschweig, Universitätsplatz 2, 38 106Braunschweig, Germany;

关键词: edge stability number;    line stability;    invariant;    chromatic edge stability index;    chromatic index;    edge coloring;    05c15;   

DOI  :  10.7151/dmgt.2255

来源: DOAJ

【 摘 要 】

For an arbitrary invariant ρ(G) of a graph G the ρ-edge stability number esρ(G) is the minimum number of edges of G whose removal results in a graph H ⊆ G with ρ(H) ≠ ρ(G) or with E(H) = ∅.

【 授权许可】

Unknown