Around the number of trees in distance-hereditary graphs

DOI10.1016/J.DISC.2026.115010MaRDI QIDQ6846056zbMATH OpenFDO

Authors Danila Cherkashin, Pavel Prozorov

Publication date 12 March 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115010

zbMATH Keywords

distance-hereditary graphsEhrenborg conjecturespanning trees

Mathematics Subject Classification ID

Distance in graphs (05C12) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35)

Cites work

• Counting spanning trees in a complete bipartite graph which contain a given spanning forest
• Counting spanning trees of multiple complete split-like graph containing a given spanning forest
• Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
• Degree maximal graphs are Laplacian integral
• Distance-hereditary graphs
• Enumeration of spanning trees of certain graphs
• Enumerative properties of Ferrers graphs
• Graph Classes: A Survey
• Linear algebraic techniques for spanning tree enumeration
• Linear algebraic techniques for weighted spanning tree enumeration
• On stability of spanning tree degree enumerators
• On stability of weighted spanning tree degree enumerators
• Pattern matching for permutations
• Rank-width and vertex-minors
• Spanning tree enumeration and nearly triangular graph Laplacians
• The number of spanning trees in a superprism
• Tree enumeration polynomials on separable permutations

This page was built for publication: Around the number of trees in distance-hereditary graphs

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