Abstract
A graph is stability critical (α-critical) if the removal of any edge increases the stability number. We give an affirmative answer to a question raised by Chváktal, namely, that every connected, critical graph that is neither K2 nor an odd cycle contains an even subdivision of K4
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
