Yibo Gao, Junyao Peng
Published 2018-09-26Version 1
A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously. In this paper, we focus on complete bipartite graphs and trees. For complete bipartite graphs, we obtain an exact formula for their shelling numbers. And for trees, we propose a simple method to count shellings and bound shelling numbers using vertex degrees and diameter.
Comments: 22 pages, 6 figures
The circular $k$-partite crossing number of $K_{m,n}$
Geodesics in a Graph of Perfect Matchings
Weak saturation numbers of complete bipartite graphs in the clique
![QR code for arXiv:1809.10263 [math.CO]](http://oss.arxitics.com/images/favicon.svg)