A note on flow polynomials of graphs

DOI10.1016/J.DISC.2008.01.050zbMATH Open1205.05110OpenAlexW2133025086MaRDI QIDQ1024488FDOQ1024488

Beifang Chen, Arthur L. B. Yang

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.050

zbMATH Keywords

isomorphismtotally cyclic orientationintegral flow polynomialEulerian-equivalence classmodular flow polynomial

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph polynomials (05C31) Flows in graphs (05C21)

Cites Work

• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Tension polynomials of graphs
• Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs
• On the Imbedding of Linear Graphs in Surfaces
• The number of nowhere-zero flows on graphs and signed graphs
• Polynomials associated with nowhere-zero flows
• Orientations, lattice polytopes, and group arrangements. II: Modular and integral flow polynomials of graphs

Cited In (5)

• Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs
• Title not available (Why is that?)
• Flows on C² with polynomial time one map
• Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs
• Chromatic and flow polynomials for directed graphs

This page was built for publication: A note on flow polynomials of graphs

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