Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9514598 | Electronic Notes in Discrete Mathematics | 2005 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
RafaÅ Kalinowski, Monika PilÅniak, Mariusz Woźniak, Irmina ZioÅo,