Abstract | ||
---|---|---|
We prove that every minimal brick on n vertices has at least n/9 vertices of degree at most 4. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1016/j.ejc.2013.06.045 | Eur. J. Comb. |
Keywords | Field | DocType |
minimal brick,n vertex,small degree | Graph center,Discrete mathematics,Combinatorics,Vertex (geometry),Brick,Mathematics,Path graph | Journal |
Volume | ISSN | Citations |
36, | 0195-6698 | 0 |
PageRank | References | Authors |
0.34 | 6 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
henning bruhn | 1 | 177 | 24.93 |
maya stein | 2 | 81 | 15.65 |