Previous |  Up |  Next


Title: On isopart parameters of complete bipartite graphs and $n$-cubes (English)
Author: Davitt, Richard M.
Author: Fink, John Frederick
Author: Jacobson, Michael S.
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 35
Issue: 4
Year: 1985
Pages: 409-415
Category: math
MSC: 05C70
MSC: 05C99
idZBL: Zbl 0585.05027
idMR: MR820639
Date available: 2009-09-25T09:50:18Z
Last updated: 2012-08-01
Stable URL:
Reference: [1] BEHZAD M., CHARTRAND G., LESNIAK-FOSTER L.: Graphs & Digraphs.Wadsworth International, Belmont, CA, 1979. Zbl 0403.05027, MR 0525578
Reference: [2] FINK J. F.: Every graph is an induced isopart of a connected regular graph.Submitted for publication.
Reference: [3] FINK J. F.: On smallest regular graphs with a given isopart.Submitted for publication. Zbl 0607.05039
Reference: [4] FINK J. F., RUIZ S.: Every graph is an induced isopart of a circulant.Submitted for publication. Zbl 0614.05052
Reference: [5] KÖNIG D.: Über Graphen und ihre Anwendung auf Determinantentheorie and Mengenlehre.Math. Ann. 77, 1916, 453-465. MR 1511872
Reference: [6] PETERSEN J.: Die Theorie der regularen Graphen.Acta Math. 15, 1891, 193-220. MR 1554815
Reference: [7] REISS M.: Über eine Steinersche kombinatorische Aufgabe.J. reine u. ang. Mathematik 56,1859, 326-344.
Reference: [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 0396347


Files Size Format View
MathSlov_35-1985-4_13.pdf 390.3Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo