"Factorizations of Complete Graphs into Trees with at most Four Non-Leave ..."

Dalibor Froncek, Petr Kovár, Michael Kubesa (2011)

> Home

Details and statistics

DOI: 10.1007/S00373-010-0991-0

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/FroncekKK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/FroncekKK11
Dalibor Froncek, Petr Kovár, Michael Kubesa:
Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices. Graphs Comb. 27(5): 621-646 (2011)

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.