On the number of \(B\)-flows of a graph

DOI10.1016/j.ejc.2013.06.009zbMath1292.05132OpenAlexW1982356654MaRDI QIDQ2509755

Jaroslav Nešetřil, Delia Garijo, Andrew J. Goodall

Publication date: 29 July 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2013.06.009

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Flows in graphs (05C21)

Related Items

Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limits of dense graph sequences
• Graph invariants in the spin model
• Chromatic invariants for finite graphs: Theme and polynomial variations
• Contractors for flows
• Reflection positivity, rank connectivity, and homomorphism of graphs
• Contractors and connectors of graph algebras
• Fundamentals of Error-Correcting Codes