"Enumeration for no-trivial spanning forests of complete bipartite graphs."

Bolian Liu, Fengying Huang (2010)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2013-03-07

- no documents available
- export record
  dblp key:
  - journals/arscom/LiuH10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/LiuH10
Bolian Liu, Fengying Huang:
Enumeration for no-trivial spanning forests of complete bipartite graphs. Ars Comb. 97 (2010)

a service of

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.