Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof (Q5207464)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof |
scientific article; zbMATH DE number 7146796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof |
scientific article; zbMATH DE number 7146796 |
Statements
Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof (English)
0 references
30 December 2019
0 references
bipartite graphs
0 references
degree sequences
0 references
spanning trees
0 references
0.93788195
0 references
0.9217015
0 references
0.92095137
0 references
0.9197415
0 references
0.91695595
0 references
0.91612685
0 references
0.9101426
0 references
0.90618765
0 references
