"Upper bound for the number of spanning forests of regular graphs."

Ferenc Bencs, Péter Csikvári (2023)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2022.103677

access: open

type: Journal Article

metadata version: 2023-05-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ejc/BencsC23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/BencsC23
Ferenc Bencs, Péter Csikvári:
Upper bound for the number of spanning forests of regular graphs. Eur. J. Comb. 110: 103677 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.