Decompositions of Complete Graphs into Factors with Diameter Two
Juraj Bosák; Pál Erdös; Alexander Rosa
Matematický časopis (1971)
- Volume: 21, Issue: 1, page 14-28
- ISSN: 0139-9918
Access Full Article
top
How to cite
topBosák, Juraj, Erdös, Pál, and Rosa, Alexander. "Decompositions of Complete Graphs into Factors with Diameter Two." Matematický časopis 21.1 (1971): 14-28. <http://eudml.org/doc/29959>.
@article{Bosák1971,
author = {Bosák, Juraj, Erdös, Pál, Rosa, Alexander},
journal = {Matematický časopis},
language = {eng},
number = {1},
pages = {14-28},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {Decompositions of Complete Graphs into Factors with Diameter Two},
url = {http://eudml.org/doc/29959},
volume = {21},
year = {1971},
}
TY - JOUR
AU - Bosák, Juraj
AU - Erdös, Pál
AU - Rosa, Alexander
TI - Decompositions of Complete Graphs into Factors with Diameter Two
JO - Matematický časopis
PY - 1971
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 21
IS - 1
SP - 14
EP - 28
LA - eng
UR - http://eudml.org/doc/29959
ER -
References
top- Bosák J., Rosa A., Znám Š., On decompositions of complete graphs into factors with given diameters, Theory of Graphs, Proc. Colloq. Tihany 1966, Akadémiai Kiadó, Budapest 1968, 37 - 56. (1966) MR0233720
- Erdös P., Rényi A., On the evolution of random graphs, Magyar tud. akad. Mat. kutató int. közl. 5 (1960), 17 61. (1960) MR0125031
- Erdös P., Rényi A., Additive properties of random sequences of positive integers, Acta Arithm. 6 (1960), 83-110. (1960) MR0120213
- Erdös P., Rényi A., Egg gráfelméleti problémáról, Magyar tud. akad. Mat. kutató int. közl. 7 (1962), 623-641. (1962) MR0193024
- Bинoгpaдoв И. M., Ocнoвы meopuu чuceл, ГИTTЛ, Mocквa-Лeнингpaд 1952. (1952)
Citations in EuDML Documents
top- Daniel Palumbíny, On a Certain Type of Decompositions of Complete Graphs into Factors with Equal Diameters
- Štefan Znám, Decomposition of complete graphs into factors of diameter two
- Pavel Tomasta, Decompositions of complete -uniform hypergraphs into factors with given diameters
- Jaroslav Březina, Použitie samočinných počítačov pri skúmání istých rozkladov kompletného grafu
- Pavol Híc, Daniel Palumbíny, Isomorphic factorisations of complete graphs into factors with a given diameter
- Pavel Tomasta, On decompositions of complete -uniform hypergraphs
- Ján Plesník, Complexity of decomposing graphs into factors with given diameters or radii
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.