Name
Abstract | ||
|---|---|---|
tree T is arbitrarily vertex decomposable if for any sequence @t of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by @t; from a result by Barth and Fournier it follows that @D(T)=<4. A necessary and a sufficient condition for being an arbitrarily vertex decomposable star-like tree have been exhibited. The conditions seem to be very close to each other. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.04.008 | Discrete Mathematics |
Keywords | Field | DocType |
arbitrarily vertex decomposable tree,star-like tree | Integer,Discrete mathematics,Combinatorics,Vertex (geometry),Shortest-path tree,Mathematics | Journal |
Volume | Issue | ISSN |
308 | 7 | Discrete Mathematics |
Citations | PageRank | References |
8 | 0.98 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mirko Horňák | 1 | 127 | 16.28 |
| Mariusz Woźniak | 2 | 204 | 34.54 |