Author/Authors :
Kalinowski، نويسنده , , Rafa? and Pil?niak، نويسنده , , Monika and Wo?niak، نويسنده , , Mariusz and Zio?o، نويسنده , , Irmina A.، نويسنده ,
Abstract :
We give a complete characterization of on-line arbitrarily vertex decomposable graphs in the family of unicycle graphs called suns. A sun is a graph with maximum degree three, such that deleting vertices of degree one results in a cycle. This result has already been used in another paper to prove some Ore-type conditions for on-line arbitrarily decomposable graphs.
