Counting degree sequences of spanning trees in bipartite graphs: A graph-theoretic proof.
Anja FischerFrank FischerPublished in: J. Graph Theory (2019)
Keyphrases
- graph theoretic
- bipartite graph
- spanning tree
- minimum weight
- random graphs
- edge disjoint
- edge weights
- maximum matching
- maximum cardinality
- minimum spanning tree
- minimum cost
- minimum spanning trees
- link prediction
- graph theory
- bipartite graph matching
- undirected graph
- maximum weight
- graph properties
- hamiltonian path
- weighted graph
- maximum independent set