Published: 1997 Received: September 01, 1994Available on J-STAGE: October 20, 2006Accepted: -
Advance online publication: -
Revised: -
Correction information
Date of correction: October 20, 2006Reason for correction: -Correction: CITATIONDetails: Wrong : 1) J. A. Bondy and U.S.R. Murty, Graph Theory with Applications, North-Holland, 1984. 2) G. Chartrand and L. Lesniak, Graphs & Digraphs, 2nd ed., Wadsworth & Brooks/Cole Math. Ser., 1986. 3) Y. Egawa, personal communications. 4) H. Enomoto, Graph decompositions without isolated vertices, J. Combin. Theory Ser. B, 63 (1995), 111-124. 5) H. Enomoto, A. Kaneko and Zs. Tuza, P3-factors and covering cycles in graphs of minimum degree n/3, Colloq. Math. Soc. János Bolyai, 52 (1987), 213-220. 6) H. Enomoto and S. Matsunaga, Graph decompositions without isolated vertices III, to appear in J. Graph Theory. 7) A. Frank, The Fifth British Combinatorial Conference, Aberdeen, Scotland, 1975. 8) E. Györi, On division of graphs to connected subgraphs, Colloq. Math. Soc. János Bolyai, 18 (1978), 485-494. 9) L. Lovász, A homology theory for spanning trees of a graph, Acta Math. Acad. Sci. Hungar., 30 (1977), 241-251. 10) S. B. Maurer, The Fifth British Combinatorial Conference, Aberdeen, Scotland, 1975.
Right : [1] J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North-Holland, 1984. [2] G. Chartrand and L. Lesniak, Graphs & Digraphs, 2nd ed., Wadsworth & Brooks/Cole Math. Ser., 1986. [3] Y. Egawa, personal communications. [4] H. Enomoto, Graph decompositions without isolated vertices, J. Combin. Theory Ser. B, 63 (1995), 111-124. [5] H. Enomoto, A. Kaneko and Zs. Tuza, P3-factors and covering cycles in graphs of minimum degree n/3, Colloq. Math. Soc. János Bolyai, 52 (1987), 213-220. [6] H. Enomoto and S. Matsunaga, Graph decompositions without isolated vertices III, to appear in J. Graph Theory. [7] A. Frank, The Fifth British Combinatorial Conference, Aberdeen, Scotland, 1975. [8] E. Györi, On division of graphs to connected subgraphs, Colloq. Math. Soc. János Bolyai, 18 (1978), 485-494. [9] L. Lovász, A homology theory for spanning trees of a graph, Acta Math. Acad. Sci. Hungar., 30 (1977), 241-251. [10] S. B. Maurer, The Fifth British Combinatorial Conference, Aberdeen, Scotland, 1975.
Date of correction: October 20, 2006Reason for correction: -Correction: PDF FILEDetails: -