Line-digraphs, arborescences and theorems of Tutte and Knuth
From MaRDI portal
Publication:1226497
DOI10.1016/0095-8956(78)90038-2zbMath0328.05113OpenAlexW2001958216WikidataQ59592778 ScholiaQ59592778MaRDI QIDQ1226497
Publication date: 1978
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(78)90038-2
Related Items (22)
A combinatorial approach to matrix algebra ⋮ Determinant: Old algorithms, new insights ⋮ Bideterminants, arborescences and extension of the matrix-tree theorem to semirings ⋮ Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes ⋮ Enumeration of spanning trees of middle digraphs ⋮ Tutte's barycenter method applied to isotopies ⋮ Oriented spanning trees and stationary distribution of digraphs ⋮ On the weighted complexity of a regular covering of a graph ⋮ The Alexander polynomial of planar even valence graphs ⋮ An Elementary Proof of a Matrix Tree Theorem for Directed Graphs ⋮ The symbiotic relationship of combinatorics and matrix theory ⋮ The stochastic weighted complexity of a group covering of a digraph ⋮ Counting trees with random walks ⋮ New proofs for Levine's theorems ⋮ The weighted complexity and the determinant functions of graphs ⋮ Extension of MacMahon's master theorem to pre-semi-rings ⋮ Vertex Weighted Complexities of Graph Coverings ⋮ A generalization of the all minors matrix tree theorem to semirings ⋮ Miscellaneous Digraph Classes ⋮ Matrix-tree theorem of digraphs via signless Laplacians ⋮ Some determinant expansions and the matrix-tree theorem ⋮ A Combinatorial Proof of the All Minors Matrix Tree Theorem
Cites Work
This page was built for publication: Line-digraphs, arborescences and theorems of Tutte and Knuth
