Geodesic
On isopart parameters of complete bipartite graphs and $n$-cubes
Mathematica slovaca, Tome 35 (1985) no. 4, pp. 409-415
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C70, 05C99 
@article{MASLO_1985_35_4_a12,
     author = {Davitt, Richard M. and Fink, John Frederick and Jacobson, Michael S.},
     title = {On isopart parameters of complete bipartite graphs and $n$-cubes},
     journal = {Mathematica slovaca},
     pages = {409--415},
     year = {1985},
     volume = {35},
     number = {4},
     mrnumber = {820639},
     zbl = {0585.05027},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1985_35_4_a12/}
}
TY  - JOUR
AU  - Davitt, Richard M.
AU  - Fink, John Frederick
AU  - Jacobson, Michael S.
TI  - On isopart parameters of complete bipartite graphs and $n$-cubes
JO  - Mathematica slovaca
PY  - 1985
SP  - 409
EP  - 415
VL  - 35
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MASLO_1985_35_4_a12/
LA  - en
ID  - MASLO_1985_35_4_a12
ER  - 
%0 Journal Article
%A Davitt, Richard M.
%A Fink, John Frederick
%A Jacobson, Michael S.
%T On isopart parameters of complete bipartite graphs and $n$-cubes
%J Mathematica slovaca
%D 1985
%P 409-415
%V 35
%N 4
%U http://geodesic.mathdoc.fr/item/MASLO_1985_35_4_a12/
%G en
%F MASLO_1985_35_4_a12
Davitt, Richard M.; Fink, John Frederick; Jacobson, Michael S. On isopart parameters of complete bipartite graphs and $n$-cubes. Mathematica slovaca, Tome 35 (1985) no. 4, pp. 409-415. http://geodesic.mathdoc.fr/item/MASLO_1985_35_4_a12/

[1] BEHZAD M., CHARTRAND G., LESNIAK-FOSTER L.: Graphs & Digraphs. Wadsworth International, Belmont, CA, 1979. | MR | Zbl

[2] FINK J. F.: Every graph is an induced isopart of a connected regular graph. Submitted for publication.

[3] FINK J. F.: On smallest regular graphs with a given isopart. Submitted for publication. | Zbl

[4] FINK J. F., RUIZ S.: Every graph is an induced isopart of a circulant. Submitted for publication. | Zbl

[5] KÖNIG D.: Über Graphen und ihre Anwendung auf Determinantentheorie and Mengenlehre. Math. Ann. 77, 1916, 453-465. | MR

[6] PETERSEN J.: Die Theorie der regularen Graphen. Acta Math. 15, 1891, 193-220. | MR

[7] REISS M.: Über eine Steinersche kombinatorische Aufgabe. J. reine u. ang. Mathematik 56,1859, 326-344.

[8] WILSON R. M.: Decompositions of complete graphs into subgraphs isomorphic to a given graph. Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975) 647-659. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man. (1976). | MR