Decomposition of an infinite complete graph into complete bipartite subgraphs
Časopis pro pěstování matematiky (1984)
- Volume: 109, Issue: 3, page 266-267
- ISSN: 0528-2195
Access Full Article
top
How to cite
topZelinka, Bohdan. "Decomposition of an infinite complete graph into complete bipartite subgraphs." Časopis pro pěstování matematiky 109.3 (1984): 266-267. <http://eudml.org/doc/19259>.
@article{Zelinka1984,
author = {Zelinka, Bohdan},
journal = {Časopis pro pěstování matematiky},
keywords = {infinite graph; complete bipartite graph},
language = {eng},
number = {3},
pages = {266-267},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {Decomposition of an infinite complete graph into complete bipartite subgraphs},
url = {http://eudml.org/doc/19259},
volume = {109},
year = {1984},
}
TY - JOUR
AU - Zelinka, Bohdan
TI - Decomposition of an infinite complete graph into complete bipartite subgraphs
JO - Časopis pro pěstování matematiky
PY - 1984
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 109
IS - 3
SP - 266
EP - 267
LA - eng
KW - infinite graph; complete bipartite graph
UR - http://eudml.org/doc/19259
ER -
References
top- R. L. Graham H. O. Pollak, On embedding graphs in squashed cubes, In: Gгaph Theory and Applications, Proc. Conf. Western Michigan University, May 10-13, 1972. Ed. Alavi Y. - Lick D. R. - White A. T. Lecture Notes in Math. 303. Springer Berlin-Heidelberg-New York 1972, 99-110. (1972) MR0332576
- H. Tverberg, On the decomposition of Kn into complete bipartite graphs, Ј. Graph Theory 6 (1982), 493-494. (1982) MR0679606
Citations in EuDML Documents
topNotesEmbed ?
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.