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

From MaRDI portal





scientific article; zbMATH DE number 6873176
Language Label Description Also known as
default for all languages
No label defined
    English
    Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4
    scientific article; zbMATH DE number 6873176

      Statements

      Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4 (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      25 May 2018
      0 references
      Summary: As projections of links, 4-regular plane graphs are important in combinatorial knot theory. The flow polynomial of 4-regular plane graphs has a close relation with the two-variable Kauffman polynomial of links. In [J. Comb. Theory, Ser. B 52, No. 2, 259--273 (1991; Zbl 0681.05025)], \textit{F. Jaeger} provided even subgraph expansions for the flow polynomial of cubic plane graphs. Starting from and based on Jaeger's work, by introducing splitting systems of even subgraphs, we extend Jaeger's results from cubic plane graphs to plane graphs with maximum degree at most 4 including 4-regular plane graphs as special cases. Several consequences are derived and further work is discussed.
      0 references

      Identifiers