Counting Shellings of Complete Bipartite Graphs and Trees
From MaRDI portal
Publication:6307352
DOI10.1007/S10801-020-00965-0arXiv1809.10263MaRDI QIDQ6307352FDOQ6307352
Authors: Yi-Bo Gao, Junyao Peng 
Publication date: 26 September 2018
Abstract: 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 relate their shelling numbers to linear extensions of tree posets and bound shelling numbers using vertex degrees and diameter.
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of simplicial complexes (05E45)
This page was built for publication: Counting Shellings of Complete Bipartite Graphs and Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6307352)
