Name
Abstract | ||
|---|---|---|
Bryant et¿al. (2014) propose a graph cleaning process and study the corresponding brush number. As their main result they show that the brush number of a tree with ¿ leaves is at least ¿ ¿ + 1 2 ¿ and at most ¿ ¿ + 1 2 ¿ . Answering one of their questions, we show that the trees with an even number ¿ of leaves and brush number ¿ 2 can be recognized efficiently. Furthermore, we provide a simpler proof of their main result. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.dam.2015.06.004 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Network cleaning,Brush number,Nowhere-zero flows | Discrete mathematics,Graph,Combinatorics,Brush,Mathematics | Journal |
Volume | Issue | ISSN |
194 | C | 0166-218X |
Citations | PageRank | References |
1 | 0.37 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lucia Draque Penso | 1 | 196 | 20.46 |
| Dieter Rautenbach | 2 | 946 | 138.87 |
| Aline Ribeiro de Almeida | 3 | 6 | 1.58 |