Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof

DOI10.1002/JGT.22449MaRDI QIDQ5207464zbMATH OpenOpenAlexWikidataFDO

Authors Anja Fischer, Frank Fischer

Publication date 30 December 2019

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.22449

zbMATH Keywords

bipartite graphsdegree sequencesspanning trees

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Recommendations

• The number of spanning trees in graphs with a given degree sequence
• Counting spanning trees in a complete bipartite graph which contain a given spanning forest
• Number of spanning trees in the sequence of some graphs
• Counting spanning trees in almost complete multipartite graphs
• Spanning \(k\)-trees of bipartite graphs
• Degree sequences and graphs with disjoint spanning trees
• The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs
• Counting spanning trees in the graphs of Kleitman and Golden and a generalization
• The number of spanning trees of a complete multipartite graph

Cited in

(2)

• Sequences of spanning trees and a fixed tree theorem
• Degree sequences and graphs with disjoint spanning trees

This page was built for publication: Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207464)