Spanning trees of extended graphs

DOI10.1007/BF01191204zbMATH Open0776.05032OpenAlexW1977380515MaRDI QIDQ1193532FDOQ1193532

Authors: Alexander Kelmans 

Publication date: 27 September 1992

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01191204

Recommendations

• scientific article; zbMATH DE number 55681
• On encodings of spanning trees
• Maximizing spanning trees in almost complete graphs
• scientific article; zbMATH DE number 932184
• The number of spanning trees of a complete multipartite graph

zbMATH Keywords

spanning treesvolumeextensionmatrix-tree theoremPrüfer coding

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Cites Work

• Comparison of graphs by their number of spanning trees
• A certain polynomial of a graph and graphs with an extremal number of trees
• Число Деревьев Графа, Содержащих Заднный Лес

Cited In (17)

• Title not available (Why is that?)
• On encodings of spanning trees
• Snarks with special spanning trees
• Expanders Are Universal for the Class of All Spanning Trees
• A blossoming algorithm for tree volumes of composite digraphs
• Graphs with only caterpillars as spanning trees
• Spanning cactus of a graph: Existence, extension, optimization, and approximation
• Spanning trees of descendants of a complete graph
• How to Use Spanning Trees to Navigate in Graphs
• Generalizations of Abel's and Hurwitz's identities
• Spanning cactus: complexity and extensions
• Spanning trees and function classes
• An extension of the Prüfer code and assembly of connected graphs from their blocks
• Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions
• Ends in spanning trees
• Extension of spanning tree and applications
• The number of spanning trees of a complete multipartite graph

This page was built for publication: Spanning trees of extended graphs

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