Pages that link to "Item:Q1226497"
From MaRDI portal
The following pages link to Line-digraphs, arborescences and theorems of Tutte and Knuth (Q1226497):
Displaying 21 items.
- New proofs for Levine's theorems (Q551241) (← links)
- The stochastic weighted complexity of a group covering of a digraph (Q947654) (← links)
- The weighted complexity and the determinant functions of graphs (Q975601) (← links)
- A combinatorial approach to matrix algebra (Q1086566) (← links)
- The symbiotic relationship of combinatorics and matrix theory (Q1183182) (← links)
- A generalization of the all minors matrix tree theorem to semirings (Q1297437) (← links)
- Some determinant expansions and the matrix-tree theorem (Q1313835) (← links)
- Bideterminants, arborescences and extension of the matrix-tree theorem to semirings (Q1363700) (← links)
- Tutte's barycenter method applied to isotopies (Q1395577) (← links)
- On the weighted complexity of a regular covering of a graph (Q1410729) (← links)
- The Alexander polynomial of planar even valence graphs (Q1415388) (← links)
- Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes (Q1917322) (← links)
- Counting trees with random walks (Q2003395) (← links)
- Matrix-tree theorem of digraphs via signless Laplacians (Q2104963) (← links)
- Vertex Weighted Complexities of Graph Coverings (Q3067773) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- A Combinatorial Proof of the All Minors Matrix Tree Theorem (Q3958479) (← links)
- Determinant: Old algorithms, new insights (Q5054863) (← links)
- An Elementary Proof of a Matrix Tree Theorem for Directed Graphs (Q5137223) (← links)
- Extension of MacMahon's master theorem to pre-semi-rings (Q5955644) (← links)
- Oriented spanning trees and stationary distribution of digraphs (Q6170341) (← links)
