Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4

zbMATH Open1390.05105MaRDI QIDQ1753103FDOQ1753103

E. G. Tay, F. M. Dong, Xianan Jin, Qingying Deng

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p7

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Graph polynomials (05C31)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Contribution to the Theory of Chromatic Polynomials
• An Invariant of Regular Isotopy
• LINK POLYNOMIALS AND A GRAPHICAL CALCULUS
• Graphs on Surfaces
• The Potts model and the Tutte polynomial.
• Le Polynôme De Martin D'un Graphe Eulerien
• An upper bound for the number of Eulerian orientations of a regular graph
• A Course in Enumeration
• From planar graphs to embedded graphs -- a new approach to Kauffman and Vogel's polynomial
• Even subgraph expansions for the flow polynomial of cubic plane maps

This page was built for publication: Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4

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