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 characterized among k-regular graphs for k≤5. Several open problems are also stated.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
