Coding and counting spanning trees in Kleitman-Golden graphs

L. M. Koganov

Type: Article

Publication Date: 1991-01-01

Citations: 0

DOI: https://doi.org/10.1007/bf01068310

View Publication

Locations

Cybernetics - View

Similar Works

Action	Title	Year	Authors
+	Counting spanning trees in the graphs of Kleitman and Golden and a generalization	1984	Rakesh Vohra Lawrence C. Washington
+	Enumerating spanning trees of graphs with an involution	2008	Fuji Zhang Weigen Yan
+	Counting spanning trees in almost complete multipartite graphs	2022	Sujing Cheng Wu‐Xian Chen Weigen Yan
+	Counting graphs	2025	Miklós Bóna
+	Tree spanners of bounded degree graphs	2017	Ioannis Papoutsakis
+	Enumeration of labeled block-cactus graphs	2014	V. A. Voblyi A. K. Meleshko
+	Counting spanning trees of a type of generalized Farey graphs	2020	Jingyuan Zhang Weigen Yan
+	Counting spanning trees in directed regular multigraphs	1989	Jacek Wojciechowski Michael R. Fellows
+	Generating functions and counting formulas for spanning trees and forests in hypergraphs	2024	Jiuqiang Liu Shenggui Zhang Guihai Yu
+	Spanning trees with bounded degrees	1991	Vı́ctor Neumann-Lara Eduardo Rivera‐Campo
+	Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph	2012	Haruhide Matsuda Kenta Ozeki Tomoki Yamashita
+	Spanning Eulerian subgraphs and Catlin’s reduced graphs	2016	Weiguo Chen Zhi-Hong Chen
+	Counting tree-like graphs in locally dense graphs	2017	Joonkyung Lee
+	Existence and enumeration of spanning structures in sparse graphs and hypergraphs	2016	Julia Ehrenmüller
+ PDF Chat	Counting Colorings of a Regular Graph	2014	David Galvin
+	Cover Pebbling Thresholds for the Complete Graph	2005	Anant P. Godbole Nathaniel G. Watson Carl Yerger
+	Extremal graph theory: supersaturation and enumeration	2015	Hong Liu
+	Classification of Ryser graphs	2009	Alexander L. Gavrilyuk
+	Codings of graphs with binary edge labels	1994	Martin Aigner Eberhard Triesch
+	Counting labeled claw-free cubic graphs by connectivity	2008	Gab-Byung Chae

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (10)

Action	Title	Year	Authors
+	Matrix Tree Theorems	1978	Seth Chaiken Daniel J. Kleitman
+ PDF Chat	Baxter algebras and combinatorial identities. II	1969	Gian‐Carlo Rota
+	Applied combinatorial mathematics	1968	L.S Chistyakov S.S. Lavrov
+	Counting spanning trees in the graphs of Kleitman and Golden and a generalization	1984	Rakesh Vohra Lawrence C. Washington
+	Spanning tree formulas and chebyshev polynomials	1986	F Boesch Helmut Prodinger
+	A Combinatorial Proof of the All Minors Matrix Tree Theorem	1982	Seth Chaiken
+	Pólya’s Theory of Counting	2009	George Pólya Robert E. Tarjan Donald R. Woods
+	An Introduction to Combinatorial Analysis	1958	R. A. Leibler John Riordan
+	An Introduction to Combinatorial Analysis	1959	L. Schmetterer J. Riordan
+	The Number of Spanning Trees in the Square of a Cycle	1985	Gerd Baron Helmut Prodinger Robert F. Tichy F Boesch J. F. Wang