论文信息 - On-line arbitrarily vertex decomposable suns

On-line arbitrarily vertex decomposable suns

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.

Mariusz Wozniak | Irmina A. Ziolo | Monika Pilsniak | Rafal Kalinowski

[1] Dennis Saleh. Zs , 2001 .

[2] Mirko Hornák,et al. On arbitrarily vertex decomposable trees , 2008, Discret. Math..

[3] Mariusz Wozniak,et al. Arbitrarily vertex decomposable suns with few rays , 2009, Discret. Math..

[4] Jakub Przybylo,et al. Arbitrarily vertex decomposable caterpillars with four or five leaves , 2006, Discuss. Math. Graph Theory.

[5] Dominique Barth,et al. Decomposable trees: a polynomial algorithm fortripodes , 2002, Discret. Appl. Math..

[6] Dominique Barth,et al. A degree bound on decomposable trees , 2006, Discret. Math..

[7] M. Hornák,et al. ARBITRARILY VERTEX DECOMPOSABLE TREES ARE OF MAXIMUM DEGREE AT MOST SIX , 2003 .

[8] Zsolt Tuza,et al. On-line arbitrarily vertex decomposable trees , 2007, Discret. Appl. Math..

[9] Antoni Marczyk,et al. A note on arbitrarily vertex decomposable graphs , 2006 .

[10] Antoni Marczyk,et al. An Ore-type condition for arbitrarily vertex decomposable graphs , 2005, Electron. Notes Discret. Math..