Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86080365" target="_blank" >RIV/61989100:27240/11:86080365 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00373-010-0991-0" target="_blank" >http://dx.doi.org/10.1007/s00373-010-0991-0</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00373-010-0991-0" target="_blank" >10.1007/s00373-010-0991-0</a>
Alternative languages
Result language
angličtina
Original language name
Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices
Original language description
We give a complete characterization of trees with at most four non-leave vertices, which factorize the complete graph K_{2n}.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Graphs and Combinatorics
ISSN
0911-0119
e-ISSN
—
Volume of the periodical
27
Issue of the periodical within the volume
5
Country of publishing house
JP - JAPAN
Number of pages
26
Pages from-to
621-646
UT code for WoS article
000293791300001
EID of the result in the Scopus database
—