Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4
The electronic journal of combinatorics, Tome 25 (2018) no. 2
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. F. Jaeger in 1991 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.
@article{10_37236_7411,
author = {Qingying Deng and Xian'an Jin and Fengming Dong and Eng Guan Tay},
title = {Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4},
journal = {The electronic journal of combinatorics},
year = {2018},
volume = {25},
number = {2},
doi = {10.37236/7411},
zbl = {1390.05105},
url = {http://geodesic.mathdoc.fr/articles/10.37236/7411/}
}
TY - JOUR AU - Qingying Deng AU - Xian'an Jin AU - Fengming Dong AU - Eng Guan Tay TI - Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4 JO - The electronic journal of combinatorics PY - 2018 VL - 25 IS - 2 UR - http://geodesic.mathdoc.fr/articles/10.37236/7411/ DO - 10.37236/7411 ID - 10_37236_7411 ER -
%0 Journal Article %A Qingying Deng %A Xian'an Jin %A Fengming Dong %A Eng Guan Tay %T Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4 %J The electronic journal of combinatorics %D 2018 %V 25 %N 2 %U http://geodesic.mathdoc.fr/articles/10.37236/7411/ %R 10.37236/7411 %F 10_37236_7411
Qingying Deng; Xian'an Jin; Fengming Dong; Eng Guan Tay. Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4. The electronic journal of combinatorics, Tome 25 (2018) no. 2. doi: 10.37236/7411
Cité par Sources :