论文信息 - Some families of arbitrarily vertex decomposable graphs

Some families of arbitrarily vertex decomposable graphs

Abstract We give a complete characterization of some families of arbitrarily vertex decomposable unicyclic graphs. We consider also the ‘on-line’ version of the problem.

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

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

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

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

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