Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2008.11.025 | Discrete Mathematics |
Keywords | Field | DocType |
partition on-line,arbitrary partition of graphs,partition on-line.,arbitrary partition (vertex decomposition) of graphs,arbitrary partition vertex decomposition of trees | Discrete mathematics,Suns in alchemy,Graph,Combinatorics,Line graph,Vertex (geometry),Vertex (graph theory),Chordal graph,Degree (graph theory),Mathematics | Journal |
Volume | Issue | ISSN |
309 | 22 | Discrete Mathematics |
Citations | PageRank | References |
5 | 0.60 | 6 |
Authors | ||
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 A. Zioło | 4 | 16 | 3.98 |