Name
Abstract | ||
|---|---|---|
Let G be a graph and S be a set of non-negative integers. By an S -degree free spanning forest of G we mean a spanning forest of G with no vertex degree in S . In this paper we study the existence of { 0 , 2 } -degree free spanning forests in graphs. We show that if G is a graph with minimum degree at least 4, then there exists a { 0 , 2 } -degree free spanning forest. Moreover, we show that every 2-connected graph with maximum degree at least 5 admits a { 0 , 2 } -degree free spanning forest, and every 3-connected graph admits a { 0 , 2 } -degree free spanning forest. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.disc.2015.01.034 | Discrete Mathematics |
Keywords | Field | DocType |
factor,s -degree free,spanning forest,s | Integer,Discrete mathematics,Graph,Combinatorics,Minimum degree spanning tree,Graph factorization,Spanning tree,Degree (graph theory),Shortest-path tree,Arboricity,Mathematics | Journal |
Volume | Issue | ISSN |
338 | 7 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saieed Akbari | 1 | 1 | 1.71 |
| Kenta Ozeki | 2 | 2 | 1.42 |
| A. Rezaei | 3 | 0 | 2.03 |
| R. Rotabi | 4 | 15 | 2.72 |
| S. Sabour | 5 | 92 | 6.55 |