Two-factorizations of small complete graphs II: The case of 13 vertices
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F04%3A03102091" target="_blank" >RIV/68407700:21230/04:03102091 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Two-factorizations of small complete graphs II: The case of 13 vertices
Original language description
We establish that for each of the 5005 possible types of 2-factorizations of the complete graph K13, there exists at least one solution. We also enumerate all nonisomorphic solutions to the Oberwolfach problem OP(13;3,3,3,4).
Czech name
Není k dispozici
Czech description
Není k dispozici
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
2004
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
Journal of Combinatorial Mathematics and Combinatorial Computing
ISSN
0835-3026
e-ISSN
—
Volume of the periodical
51
Issue of the periodical within the volume
—
Country of publishing house
US - UNITED STATES
Number of pages
6
Pages from-to
89-94
UT code for WoS article
—
EID of the result in the Scopus database
—