Absolute retracts of split graphs
β
Sandi KlavΕΎar
π
Article
π
1994
π
Elsevier Science
π
English
β 663 KB
It is proved that a split graph is an absolute retract of split graphs if and only if a partition of its vertex set into a stable set and a complete set is unique or it is a complete split graph. Three equivalent conditions for a split graph to be an absolute retract of the class of all graphs are g