Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.endm.2005.06.100 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Arbitrary partition (vertex decomposition) of trees,partition on-line | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Vertex (graph theory),Mathematics,Vertex model | Journal |
Volume | ISSN | Citations |
22 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafał Kalinowski | 1 | 48 | 10.75 |
| Monika Pilśniak | 2 | 28 | 9.31 |
| Mariusz Woźniak | 3 | 204 | 34.54 |
| Irmina Zioło | 4 | 7 | 1.21 |