scientific article; zbMATH DE number 3047763

zbMATH Open0030.40903MaRDI QIDQ5786986FDOQ5786986

Authors: William T. Tutte 

Publication date: 1948

Title of this publication is not available (Why is that?)

zbMATH Keywords

Elementary geometry

Cited In (87)

• Tiling the Plane with Different Hexagons and Triangles
• A version of Tutte's polynomial for hypergraphs
• Coding multitype forests: application to the law of the total population of branching forests
• Laplacian dynamics on general graphs
• Binary functions, degeneracy, and alternating dimaps
• A Proof of Tuite’s Trinity Theorem and a New Determinant Formula
• Variable elimination in post-translational modification reaction networks with mass-action kinetics
• The Alexander polynomial of planar even valence graphs
• The interlace polynomial of a graph
• The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods
• Balanced vertex weightings and arborescences
• Miscellaneous Digraph Classes
• The \(Z\)-Dirac and massive Laplacian operators in the \(Z\)-invariant Ising model
• Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere
• The Grassmann-Berezin calculus and theorems of the matrix-tree type
• Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
• Counting trees with random walks
• A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
• Hopf algebras and Tutte polynomials
• Critical parameters for singular perturbation reductions of chemical reaction networks
• Graphical criteria for positive solutions to linear systems
• Euler circuits and DNA sequencing by hybridization
• A combinatorial relationship between Eulerian maps and hypermaps in orientable surfaces
• Distances of group tables and Latin squares via equilateral triangle dissections
• Realistic enzymology for post-translational modification: zero-order ultrasensitivity revisited
• Line-digraphs, arborescences and theorems of Tutte and Knuth
• Exact distribution of word counts in shuffled sequences
• Tiling of rectangles with squares and related problems via Diophantine approximation
• Node balanced steady states: unifying and generalizing complex and detailed balanced steady states
• Bicubic planar maps
• The symbiotic relationship of combinatorics and matrix theory
• Tilings of convex polygons by equilateral triangles of many different sizes
• An enumeration of equilateral triangle dissections
• Forest matrices around the Laplacian matrix
• Some determinant expansions and the matrix-tree theorem
• Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths
• Laplacian dynamics with synthesis and degradation
• Tilings of convex polygons
• The rational parameterisation theorem for multisite post-translational modification systems
• Tiling by incongruent equilateral triangles without requiring local finiteness
• Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
• On the dissection of rectangles into right-angled isosceles triangles
• The lifted root number conjecture for fields of prime degree over the rationals: an approach via trees and Euler systems
• Chemical reaction network approaches to biochemical systems theory
• Generalized bicycles
• Transportation networks: Old and new
• Lower bounds for positive roots and regions of multistationarity in chemical reaction networks
• New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs
• Some properties of a multidigraph by semi-incidence matrices
• Uniform Approximation of Solutions by Elimination of Intermediate Species in Deterministic Reaction Networks
• A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean
• Matrix tree theorems
• Multistationarity in structured reaction networks
• Leaky Electricity: 1-Chain Formulas for the Current and Voltage
• Commute times for a directed graph using an asymmetric Laplacian
• On the dependence of the existence of the positive steady states on the rate coefficients for deficiency-one mass action systems: single linkage class
• A generalization of the all minors matrix tree theorem to semirings
• Alexander polynomial and spanning trees
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Bideterminants, arborescences and extension of the matrix-tree theorem to semirings
• Matrix-tree theorem of digraphs via signless Laplacians
• Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors
• Shifted de Bruijn Graphs
• Generating functions and counting formulas for spanning trees and forests in hypergraphs
• A program for computing identity-kernels from certain directed graphs
• Multistationarity questions in reduced versus extended biochemical networks
• Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
• Universal Tutte polynomial
• GKSL generators and digraphs: computing invariant states
• Planar and Toroidal Morphs Made Easier
• Planar and toroidal morphs made easier
• Sufficient Conditions for Linear Stability of Complex-Balanced Equilibria in Generalized Mass-Action Systems
• Bernoulli Factories for Flow-Based Polytopes
• An Elementary Proof of a Matrix Tree Theorem for Directed Graphs
• Recommender systems based on matrix factorization and the properties of inferred social networks
• Obtaining the long-term behavior of master equations with finite state space from the structure of the associated state transition network
• On the Poisson equation for nonreversible Markov jump processes
• Tilings of convex sets by mutually incongruent equilateral triangles contain arbitrarily small tiles
• Orthogonal trades in complete sets of MOLS
• Exact computation of heat capacities for active particles on a graph
• Combinatorial Bernoulli factories
• A new decomposition of the graph Laplacian and the binomial structure of mass-action systems
• Oriented spanning trees and stationary distribution of digraphs
• On existence of compound perfect squared squares of small order
• Higher matrix-tree theorems and Bernardi polynomial
• Title not available (Why is that?)
• Classical results for alternating virtual links

This page was built for publication:

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