Other
Nordhaus–Gaddum and other bounds for the chromatic edge-stability number
Abstract
Let G be a graph. The chromatic edge-stability number esχ(G) of a graph G is the minimum number of edges of G whose removal results in a graph H with χ(H)=χ(G)−1. A Nordhaus–Gaddum type inequality for the chromatic edge-stability number is proved. Sharp upper bounds on esχ are given for general graphs in terms of size and of maximum degree, respectively. All bounds are demonstrated to be sharp. Graphs with esχ=1 are considered and in particular...
Paper Details
Title
Nordhaus–Gaddum and other bounds for the chromatic edge-stability number
Published Date
Feb 1, 2020
Volume
84
Pages
103042 - 103042
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History