2021
DOI: 10.48550/arxiv.2108.10657
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

On the chromatic edge stability index of graphs

Abstract: Given a non-trivial graph G, the minimum cardinality of a set of edges F in G such that χ ′ (G \ F ) < χ ′ (G) is called the chromatic edge stability index of G, denoted by es χ ′ (G), and such a (smallest) set F is called a (minimum) mitigating set. While 1 ≤ es χ ′ (G) ≤ ⌊n/2⌋ holds for any graph G, we investigate the graphs with extremal and near-extremal values of es χ ′ (G). The graphs G with es χ ′ (G) = ⌊n/2⌋ are classified, and the graphs G with es χ ′ (G) = ⌊n/2⌋ − 1 and χ ′ (G) = ∆(G) + 1 are charact… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…In [6] progress on three open problems from [1] are reported. The chromatic edge stability number has been generalized to arbitrary graphical invariants in [7], where in particular it was considered with respect to the chromatic index, see also [2,3].…”
Section: Introductionmentioning
confidence: 99%
“…In [6] progress on three open problems from [1] are reported. The chromatic edge stability number has been generalized to arbitrary graphical invariants in [7], where in particular it was considered with respect to the chromatic index, see also [2,3].…”
Section: Introductionmentioning
confidence: 99%