The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees

Jun Ge, Yamin Yu. The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees. Comput. Appl. Math., 45(10):415, December 2026. [doi]

@article{GeY26,
  title = {The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees},
  author = {Jun Ge and Yamin Yu},
  year = {2026},
  month = {December},
  doi = {10.1007/s40314-026-03789-z},
  url = {https://doi.org/10.1007/s40314-026-03789-z},
  researchr = {https://researchr.org/publication/GeY26},
  cites = {0},
  citedby = {0},
  journal = {Comput. Appl. Math.},
  volume = {45},
  number = {10},
  pages = {415},
}